Sciweavers

1100 search results - page 90 / 220
» Approximate distance oracles
Sort
View
FOCS
2004
IEEE
15 years 1 months ago
The Hardness of Metric Labeling
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels a...
Julia Chuzhoy, Joseph Naor
CDC
2009
IEEE
173views Control Systems» more  CDC 2009»
15 years 2 months ago
A contractivity approach for probabilistic bisimulations of diffusion processes
— This work is concerned with the problem of characterizing and computing probabilistic bisimulations of diffusion processes. A probabilistic bisimulation relation between two su...
Alessandro Abate
MJ
2006
138views more  MJ 2006»
14 years 10 months ago
A CAM-based keyword match processor architecture
This paper demonstrates a keyword match processor capable of performing fast dictionary search with approximate match capability. Using a content addressable memory with processor...
Long Bu, John A. Chandy
FOIKS
2004
Springer
15 years 3 months ago
Query Answering and Containment for Regular Path Queries under Distortions
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...
Gösta Grahne, Alex Thomo
IJAHUC
2008
83views more  IJAHUC 2008»
14 years 10 months ago
Connectivity of a Gaussian network
: Following Etherington, Hoge and Parkes, we consider a network consisting of (approximately) N transceivers in the plane R2 distributed randomly with density given by a Gaussian d...
Paul N. Balister, Béla Bollobás, Ami...