Sciweavers

4541 search results - page 430 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
GPCE
2007
Springer
15 years 8 months ago
Library composition and adaptation using c++ concepts
Large scale software is composed of libraries produced by different entities. Non-intrusive and efficient mechanisms for adapting data structures from one library to conform to AP...
Jaakko Järvi, Matthew A. Marcus, Jacob N. Smi...
EMO
2006
Springer
87views Optimization» more  EMO 2006»
15 years 8 months ago
Symbolic Archive Representation for a Fast Nondominance Test
Abstract. Archives are used in Multi-Objective Evolutionary Algorithms to establish elitism. Depending on the optimization problem, an unconstrained archive may grow to an immense ...
Martin Lukasiewycz, Michael Glaß, Christian ...
132
Voted
PREMI
2005
Springer
15 years 10 months ago
Fusing Depth and Video Using Rao-Blackwellized Particle Filter
We address the problem of fusing sparse and noisy depth data obtained from a range finder with features obtained from intensity images to estimate ego-motion and refine 3D struct...
Amit K. Agrawal, Rama Chellappa
MICCAI
2008
Springer
16 years 6 months ago
Discovering Modes of an Image Population through Mixture Modeling
Abstract. We present iCluster, a fast and efficient algorithm that clusters a set of images while co-registering them using a parameterized, nonlinear transformation model. The out...
Mert R. Sabuncu, Serdar K. Balci, Polina Golland
SODA
2010
ACM
205views Algorithms» more  SODA 2010»
16 years 2 months ago
Maximum Flows and Parametric Shortest Paths in Planar Graphs
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
Jeff Erickson