Sciweavers

974 search results - page 80 / 195
» pairing 2010
Sort
View
ACCV
2010
Springer
13 years 11 months ago
Efficient Large-Scale Stereo Matching
ACCV In this paper we propose a novel approach to binocular stereo for fast matching of high-resolution images. Our approach builds a prior on the disparities by forming a ...
Andreas Geiger, Martin Roser and Raquel Urtasun
CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 10 months ago
Optimal topological simplification of discrete functions on surfaces
We solve the problem of minimizing the number of critical points among all functions on a surface within a prescribed distance from a given input function. The result is achieved...
Ulrich Bauer, Carsten Lange, Max Wardetzky
SODA
2010
ACM
189views Algorithms» more  SODA 2010»
14 years 7 months ago
Correlation Clustering with Noisy Input
Correlation clustering is a type of clustering that uses a basic form of input data: For every pair of data items, the input specifies whether they are similar (belonging to the s...
Claire Mathieu, Warren Schudy
CNSR
2010
IEEE
164views Communications» more  CNSR 2010»
14 years 1 months ago
Buffered Crossbar Fabrics Based on Networks on Chip
— Buffered crossbar (CICQ) switches have shown a high potential in scaling Internet routers capacity. However, they require expensive on-chip buffers whose cost grows quadratical...
Lotfi Mhamdi, Kees Goossens, Iria Varela Senin
INFOCOM
2010
IEEE
13 years 8 months ago
Limitations and Possibilities of Path Trading between Autonomous Systems
Abstract—When forwarding packets in the Internet, Autonomous Systems (ASes) frequently choose the shortest path in their network to the next-hop AS in the BGP path, a strategy kn...
Yuval Shavitt, Yaron Singer