1644 search results - page 296 / 329 » Finding Dominators in Practice |
121
click to vote
MOBIHOC
2002
ACM
16 years 1 months ago
2002
ACM
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
120
click to vote
WSDM
2010
ACM
15 years 11 months ago
2010
ACM
Online social networks are now a popular way for users to connect, express themselves, and share content. Users in today's online social networks often post a profile, consis...
157
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
WWW
2010
ACM
15 years 9 months ago
2010
ACM
In an ideal world, interface design is the art and science of helping users accomplish tasks in a timely, efficient, and pleasurable manner. This paper studies the inverse situati...
148
click to vote
ICDE
2010
IEEE
15 years 8 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...