Sciweavers

3367 search results - page 316 / 674
» Incremental assignment problem
Sort
View
RSA
2010
118views more  RSA 2010»
15 years 3 months ago
Weight of a link in a shortest path tree and the Dedekind Eta function
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...
Piet Van Mieghem
TALG
2010
101views more  TALG 2010»
15 years 3 months ago
Reasoning about online algorithms with weighted automata
We describe an automata-theoretic approach for the competitive analysis of online algorithms. Our approach is based on weighted automata, which assign to each input word a cost in...
Benjamin Aminof, Orna Kupferman, Robby Lampert
CVPR
2009
IEEE
16 years 12 months ago
A Tensor-Based Algorithm for High-Order Graph Matching
This paper addresses the problem of establishing correspondences between two sets of visual features using higher-order constraints instead of the unary or pairwise ones used in...
Francis R. Bach, In-So Kweon, Jean Ponce, Olivier ...
CVPR
2004
IEEE
16 years 6 months ago
Segment-Based Stereo Matching Using Graph Cuts
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...
Li Hong, George Chen
170
Voted
ICDE
2009
IEEE
170views Database» more  ICDE 2009»
15 years 11 months ago
On High Dimensional Projected Clustering of Uncertain Data Streams
— In this paper, we will study the problem of projected clustering of uncertain data streams. The use of uncertainty is especially important in the high dimensional scenario, bec...
Charu C. Aggarwal