Sciweavers

1538 search results - page 104 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
126
Voted
RSS
2007
129views Robotics» more  RSS 2007»
15 years 5 months ago
Spatially-Adaptive Learning Rates for Online Incremental SLAM
— Several recent algorithms have formulated the SLAM problem in terms of non-linear pose graph optimization. These algorithms are attractive because they offer lower computationa...
Edwin Olson, John J. Leonard, Seth J. Teller
SCAM
2008
IEEE
15 years 10 months ago
Precise Analysis of Java Programs Using JOANA
The JOANA project (Java Object-sensitive ANAlysis) is a program analysis infrastructure for the Java language. It contains a wide range of analysis techniques such as dependence g...
Dennis Giffhorn, Christian Hammer
153
Voted
CVPR
2009
IEEE
16 years 10 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002
131
Voted
DAWAK
2007
Springer
15 years 9 months ago
MOSAIC: A Proximity Graph Approach for Agglomerative Clustering
Representative-based clustering algorithms are quite popular due to their relative high speed and because of their sound theoretical foundation. On the other hand, the clusters the...
Jiyeon Choo, Rachsuda Jiamthapthaksin, Chun-Sheng ...
136
Voted
DAC
2006
ACM
16 years 4 months ago
Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs
Multimedia applications usually have throughput constraints. An implementation must meet these constraints, while it minimizes resource usage and energy consumption. The compute i...
Sander Stuijk, Marc Geilen, Twan Basten