Sciweavers

1330 search results - page 123 / 266
» Dynamic Data Structures for Fat Objects and Their Applicatio...
Sort
View
CVPR
2008
IEEE
16 years 3 months ago
Globally optimal bilinear programming for computer vision applications
We present a practical algorithm that provably achieves the global optimum for a class of bilinear programs commonly arising in computer vision applications. Our approach relies o...
Manmohan Krishna Chandraker, David J. Kriegman
SSD
2009
Springer
180views Database» more  SSD 2009»
15 years 8 months ago
Indexing Moving Objects Using Short-Lived Throwaway Indexes
With the exponential growth of moving objects data to the Gigabyte range, it has become critical to develop effective techniques for indexing, updating, and querying these massive ...
Jens Dittrich, Lukas Blunschi, Marcos Antonio Vaz ...
SLSFS
2005
Springer
15 years 7 months ago
Incorporating Constraints and Prior Knowledge into Factorization Algorithms - An Application to 3D Recovery
Abstract. Matrix factorization is a fundamental building block in many computer vision and machine learning algorithms. In this work we focus on the problem of ”structure from mo...
Amit Gruber, Yair Weiss
MOBISYS
2005
ACM
16 years 1 months ago
Horde: separating network striping policy from mechanism
Inverse multiplexing, or network striping, allows the construction of a high-bandwidth virtual channel from a collection of multiple low-bandwidth network channels. Striping syste...
Asfandyar Qureshi, John V. Guttag
114
Voted
IJON
2010
121views more  IJON 2010»
14 years 11 months ago
Sample-dependent graph construction with application to dimensionality reduction
Graph construction plays a key role on learning algorithms based on graph Laplacian. However, the traditional graph construction approaches of -neighborhood and k-nearest-neighbor...
Bo Yang, Songcan Chen