Sciweavers

282 search results - page 9 / 57
» Efficient bundle sorting
Sort
View
ISCI
2006
167views more  ISCI 2006»
13 years 7 months ago
Efficient unbalanced merge-sort
Sorting algorithms based on successive merging of ordered subsequences are widely used, due to their efficiency and to their intrinsically parallelizable structure. Among them, th...
Enrico Nardelli, Guido Proietti
CVPR
2008
IEEE
14 years 9 months ago
Skeletal graphs for efficient structure from motion
We address the problem of efficient structure from motion for large, unordered, highly redundant, and irregularly sampled photo collections, such as those found on Internet photo-...
Noah Snavely, Steven M. Seitz, Richard Szeliski
ENTCS
2006
114views more  ENTCS 2006»
13 years 7 months ago
Towards Efficient, Typed LR Parsers
The LR parser generators that are bundled with many functional programming language implementations produce code that is untyped, needlessly inefficient, or both. We show that, us...
François Pottier, Yann Régis-Gianas
PVLDB
2008
90views more  PVLDB 2008»
13 years 6 months ago
Sorting hierarchical data in external memory for archiving
Sorting hierarchical data in external memory is necessary for a wide variety of applications including archiving scientific data and dealing with large XML datasets. The topic of ...
Ioannis Koltsidas, Heiko Müller, Stratis Vigl...
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
14 years 24 days ago
Statistical analysis of heuristics for evolving sorting networks
Designing efficient sorting networks has been a challenging combinatorial optimization problem since the early 1960’s. The application of evolutionary computing to this problem ...
Lee K. Graham, Hassan Masum, Franz Oppacher