Treffer 1 - 20
von 1.939.081
Efficient processing of all neighboring object group queries with budget range constraint in road networks.
Huang, Yuan-Ko ; Lee, Chien-Pang
Computing. May2024, Vol. 106 Issue 5, p1359-1393. 35p.
Efficient Algorithms for Range Mode Queries in the Big Data Era.
Karras, Christos ; Theodorakopoulos, Leonidas ; Karras, Aristeidis ; et al.
Information. Aug2024, Vol. 15 Issue 8, p450. 37p.
Properties and Data Structures for Efficient Adaptive Control Algorithms in Robot Manipulators
Computer aided control systems design
Fernandez, J. C. ; Penalver, L. ; Hernandez, V. ; et al.
COMPUTER AIDED CONTROL SYSTEMS DESIGN -IFAC SYMPOSIUM-. :271-276
Efficient querying k-trusses on temporal graphs.
Tan, Yuting ; Wang, Chunhua ; Zhou, Junfeng ; et al.
Information Processing & Management. Mar2026:Part B, Vol. 63 Issue 2, pN.PAG-N.PAG. 1p.
Algorithm and Data Structures for Efficient Energy Maintenance during Monte Carlo Simulation of Proteins
Lotan, I. ; Schwarzer, F. ; Halperin, D. ; et al.
JOURNAL OF COMPUTATIONAL BIOLOGY. 11(5):902-932
Gappy Total Recaller: Efficient Algorithms and Data Structures for Accurate Transcriptomics
Distributed computing and internet technology
Mishra, B.
LECTURE NOTES IN COMPUTER SCIENCE, ISSN 0302-9743 ; [NO] 8956 2015. (8956):150-161
Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures
International Conference on Information and Communications Security ICICS 2007
Papamanthou, C. ; Tamassia, R.
LECTURE NOTES IN COMPUTER SCIENCE. (4861):1-15
Efficient Algorithms and Data Structures for Element-Free Galerkin Method
Biennial conference of the computation of elctromagnetic fields; (COMPUMAG 05) Part 1
Parreira, G.F. ; Fonseca, A.R. ; Lisboa, A.C. ; et al.
IEEE TRANSACTIONS ON MAGNETICS MAG. 42(4):659-662
Algorithms and Data Structures for Flash Memories.
Gal, Eran ; Toledo, Sivan
ACM Computing Surveys. Jun2005, Vol. 37 Issue 2, p138-163. 26p.
Efficient Algorithms for Sorting k-Sets in Bins
Algorithms and computation
Nagao, A. ; Seto, K. ; Teruyama, J.
LECTURE NOTES IN COMPUTER SCIENCE. (8344):225-236
I/O Efficient Algorithms for the Minimum Cut Problem on Unweighted Undirected Graphs
Algorithms and computation
Bhushan, A. ; Sajith, G.
LECTURE NOTES IN COMPUTER SCIENCE. (8344):188-199
Search Data Structures for Skewed Strings
Experimental and efficient algorithms
Crescenzi, P. ; Grossi, R. ; Italiano, G. F.
LECTURE NOTES IN COMPUTER SCIENCE. :81-96
Efficient Algorithms for the Spoonerism Problem
Fun with algorithms: 4th international conference, FUN 2007
Bockenhauer, H.-J. ; Hromkovic, J. ; Kralovic, R. ; et al.
LECTURE NOTES IN COMPUTER SCIENCE. (4475):78-92
Efficient algorithms for spatial configuration information retrieval
Sun, Haibin
Knowledge-Based Systems. Aug2009, Vol. 22 Issue 6, p403-409. 7p.
Data Structures for Efficient Dynamic Processing in 3-D.
Lalonde, Jean-François ; Vandapel, Nicolas ; Hebert, Martial
International Journal of Robotics Research. Aug2007, Vol. 26 Issue 8, p777-796. 20p.
Algorithms and Data Structures for Multi-Adaptive Time-Stepping.
JANSSON, JOHAN ; LOGG, ANDERS
ACM Transactions on Mathematical Software. 2009, Vol. 35 Issue 3, p17-17:24. 24p.
Parallel Weighted Random Sampling.
HÜBSCHLE-SCHNEIDER, LORENZ ; SANDERS, PETER
ACM Transactions on Mathematical Software. Sep2022, Vol. 48 Issue 3, p1-40. 40p.
Seeding with minimized subsequence.
Li, Xiang ; Shi, Qian ; Chen, Ke ; et al.
Bioinformatics; 2023 Supplement, Vol. 39, pi232-i241, 10p