Sciweavers

8825 search results - page 179 / 1765
» All for one or one for all
Sort
View
CVPR
2005
IEEE
16 years 3 months ago
Stereo Correspondence by Dynamic Programming on a Tree
Dynamic programming on a scanline is one of the oldest and still popular methods for stereo correspondence. While efficient, its performance is far from the state of the art becau...
Olga Veksler
ICCV
2007
IEEE
16 years 3 months ago
Normalized Cuts Revisited: A Reformulation for Segmentation with Linear Grouping Constraints
Indisputably Normalized Cuts is one of the most popular segmentation algorithms in computer vision. It has been applied to a wide range of segmentation tasks with great success. A...
Anders P. Eriksson, Carl Olsson, Fredrik Kahl
GIS
2005
ACM
16 years 2 months ago
Finding corresponding objects when integrating several geo-spatial datasets
When integrating geo-spatial datasets, a join algorithm is used for finding sets of corresponding objects (i.e., objects that represent the same real-world entity). Algorithms for...
Catriel Beeri, Yerach Doytsher, Yaron Kanza, Eliya...
PODS
2006
ACM
114views Database» more  PODS 2006»
16 years 1 months ago
On redundancy vs dependency preservation in normalization: an information-theoretic study of 3NF
A recently introduced information-theoretic approach to analyzing redundancies in database design was used to justify normal forms like BCNF that completely eliminate redundancies...
Solmaz Kolahi, Leonid Libkin
APPROX
2009
Springer
99views Algorithms» more  APPROX 2009»
15 years 8 months ago
Resource Minimization Job Scheduling
Abstract. Given a set J of jobs, where each job j is associated with release date rj, deadline dj and processing time pj, our goal is to schedule all jobs using the minimum possibl...
Julia Chuzhoy, Paolo Codenotti