Sciweavers

2354 search results - page 373 / 471
» Randomness, Stochasticity and Approximations
Sort
View
ISAAC
2003
Springer
125views Algorithms» more  ISAAC 2003»
15 years 11 months ago
A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact
Abstract Given an edge-weighted transportation network G and a list of transportation requests L, the Stacker Crane Problem is to find a minimum-cost tour for a server along the e...
Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhof...
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
15 years 10 months ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld
CCS
2001
ACM
15 years 10 months ago
New Iterative Geometric Methods for Robust Perceptual Image Hashing
We propose a novel and robust hashing paradigm that uses iterative geometric techniques and relies on observations that main geometric features within an image would approximately ...
Mehmet Kivanç Mihçak, Ramarathnam Ve...
IJCNN
2000
IEEE
15 years 10 months ago
Metrics that Learn Relevance
We introduce an algorithm for learning a local metric to a continuous input space that measures distances in terms of relevance to the processing task. The relevance is defined a...
Samuel Kaski, Janne Sinkkonen
ISAAC
1999
Springer
110views Algorithms» more  ISAAC 1999»
15 years 10 months ago
Online Routing in Triangulations
We consider online routing algorithms for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing algorit...
Prosenjit Bose, Pat Morin