Sciweavers

619 search results - page 2 / 124
» Random Bichromatic Matchings
Sort
View
CORR
2012
Springer
222views Education» more  CORR 2012»
12 years 17 days ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
SODA
2012
ACM
208views Algorithms» more  SODA 2012»
11 years 7 months ago
Partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
ICPP
2009
IEEE
13 years 2 months ago
Mediacoop: Hierarchical Lookup for P2P-VoD Services
The random seeking in P2P-VoD system requires efficient lookup for "good" suppliers. The main challenge is that good suppliers should meet two requirements: "conten...
Tieying Zhang, Jianming Lv, Xueqi Cheng
CORR
2011
Springer
176views Education» more  CORR 2011»
12 years 12 months ago
Matched Filtering from Limited Frequency Samples
In this paper, we study a simple correlation-based strategy for estimating the unknown delay and amplitude of a signal based on a small number of noisy, randomly chosen frequency-...
Armin Eftekhari, Justin K. Romberg, Michael B. Wak...
LATIN
2000
Springer
13 years 8 months ago
Small Maximal Matchings in Random Graphs
We look at the minimal size of a maximal matching in general, bipartite and
Michele Zito