Sciweavers

262 search results - page 39 / 53
» Image Registration with Minimum Spanning Tree Algorithm
Sort
View
124
Voted
APPROX
2009
Springer
153views Algorithms» more  APPROX 2009»
15 years 9 months ago
Average-Case Analyses of Vickrey Costs
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
Prasad Chebolu, Alan M. Frieze, Páll Melste...
141
Voted
EMNLP
2010
15 years 22 days ago
Dual Decomposition for Parsing with Non-Projective Head Automata
This paper introduces algorithms for nonprojective parsing based on dual decomposition. We focus on parsing algorithms for nonprojective head automata, a generalization of head-au...
Terry Koo, Alexander M. Rush, Michael Collins, Tom...
136
Voted
3DIM
2003
IEEE
15 years 6 months ago
Approximate K-D Tree Search for Efficient ICP
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
Michael A. Greenspan, Mike Yurick
125
Voted
DCC
2001
IEEE
16 years 2 months ago
Towards Compressing Web Graphs
We consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for such compression that are motivated by recently prop...
Micah Adler, Michael Mitzenmacher
151
Voted
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
15 years 9 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos