Sciweavers

1100 search results - page 59 / 220
» Approximate distance oracles
Sort
View
SISAP
2008
IEEE
175views Data Mining» more  SISAP 2008»
15 years 4 months ago
Anytime K-Nearest Neighbor Search for Database Applications
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
Weijia Xu, Daniel P. Miranker, Rui Mao, Smriti R. ...
ACL
2008
14 years 11 months ago
Machine Translation System Combination using ITG-based Alignments
Given several systems' automatic translations of the same sentence, we show how to combine them into a confusion network, whose various paths represent composite translations...
Damianos Karakos, Jason Eisner, Sanjeev Khudanpur,...
ACCV
2006
Springer
15 years 1 months ago
Effects of Image Segmentation for Approximating Object Appearance Under Near Lighting
Shading analysis of an object under near lighting is not an easy task, because the direction and distance of the light source vary over the surface of the object. Observing a small...
Takahiro Okabe, Yoichi Sato
ALGORITHMICA
2005
149views more  ALGORITHMICA 2005»
14 years 10 months ago
Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
Markus Bläser, Bodo Manthey
CIAC
2006
Springer
160views Algorithms» more  CIAC 2006»
15 years 1 months ago
An Approximation Algorithm for a Bottleneck Traveling Salesman Problem
Consider a truck running along a road. It picks up a load Li at point i and delivers it at i, carrying at most one load at a time. The speed on the various parts of the road in on...
Ming-Yang Kao, Manan Sanghi