Sciweavers

1060 search results - page 47 / 212
» On the Discovery of Random Trees
Sort
View
SODA
2012
ACM
208views Algorithms» more  SODA 2012»
13 years 13 days 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
INFOCOM
2000
IEEE
15 years 2 months ago
Heuristics for Internet Map Discovery
— Mercator is a program that uses hop-limited probes—the same primitive used in traceroute—to infer an Internet map. It uses informed random address probing to carefully expl...
Ramesh Govindan, Hongsuda Tangmunarunkit
CORR
2007
Springer
94views Education» more  CORR 2007»
14 years 10 months ago
Neighbor Discovery in Wireless Networks:A Multiuser-Detection Approach
— We examine the problem of determining which nodes are neighbors of a given one in a wireless network. We consider an unsupervised network operating on a frequencyflat Gaussian...
Daniele Angelosante, Ezio Biglieri, Marco Lops
SIGMOD
1999
ACM
87views Database» more  SIGMOD 1999»
15 years 2 months ago
On Random Sampling over Joins
A major bottleneck in implementing sampling as a primitive relational operation is the ine ciency ofsampling the output of a query. It is not even known whether it is possible to ...
Surajit Chaudhuri, Rajeev Motwani, Vivek R. Narasa...
EMMCVPR
2001
Springer
15 years 2 months ago
Matching Free Trees, Maximal Cliques, and Monotone Game Dynamics
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
Marcello Pelillo