Sciweavers

1696 search results - page 76 / 340
» Permuted function matching
Sort
View
101
Voted
CAL
2002
14 years 10 months ago
Worst-case Traffic for Oblivious Routing Functions
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...
Brian Towles, William J. Dally
STOC
2009
ACM
119views Algorithms» more  STOC 2009»
15 years 11 months ago
Explicit construction of a small epsilon-net for linear threshold functions
We give explicit constructions of epsilon nets for linear threshold functions on the binary cube and on the unit sphere. The size of the constructed nets is polynomial in the dime...
Yuval Rabani, Amir Shpilka
69
Voted
ICAD
2004
14 years 11 months ago
Creating Functional and Livable Soundscapes for Peripheral Monitoring of Dynamic Data
Sonifications must be studied in order to match listener expectancies about data representation in the form of sound. In this study, a system was designed and implemented for dyna...
Brad S. Mauney, Bruce N. Walker
ECCV
2008
Springer
16 years 4 days ago
Regularized Partial Matching of Rigid Shapes
Abstract. Matching of rigid shapes is an important problem in numerous applications across the boundary of computer vision, pattern recognition and computer graphics communities. A...
Alexander M. Bronstein, Michael M. Bronstein
146
Voted
MMSP
2008
IEEE
245views Multimedia» more  MMSP 2008»
15 years 4 months ago
A convex programming approach for color stereo matching
—This paper addresses the problem of dense disparity estimation from a pair of color stereo images. Based on a convex set theoretic formulation, the stereo matching problem is ca...
Wided Miled, Béatrice Pesquet-Popescu, Jean...