Sciweavers

876 search results - page 98 / 176
» Limits on the Usefulness of Random Oracles
Sort
View
106
Voted
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
15 years 2 months ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...
120
Voted
SOSP
1997
ACM
15 years 2 months ago
Towards Transparent and Efficient Software Distributed Shared Memory
Despite a large research effort, software distributed shared memory systems have not been widely used to run parallel applications across clusters of computers. The higher perform...
Daniel J. Scales, Kourosh Gharachorloo
ECCV
2008
Springer
16 years 2 months ago
Keypoint Signatures for Fast Learning and Recognition
Abstract. Statistical learning techniques have been used to dramatically speed-up keypoint matching by training a classifier to recognize a specific set of keypoints. However, the ...
Michael Calonder, Vincent Lepetit, Pascal Fua
107
Voted
TREC
2008
15 years 2 months ago
Weighted PageRank: Cluster-Related Weights
PageRank is a way to rank Web pages taking into account hyper-link structure of the Web. PageRank provides efficient and simple method to find out ranking of Web pages exploiting ...
Danil Nemirovsky, Konstantin Avrachenkov
113
Voted
CG
2006
Springer
15 years 26 days ago
Constrained diffusion-limited aggregation in 3 dimensions
Diffusion Limited Aggregation (DLA) has usually been studied in 2 dimensions as a model of fractal growth processes such as river networks, plant branching, frost on glass, electr...
Paul D. Bourke