Sciweavers

1982 search results - page 200 / 397
» Designing Efficient Distributed Algorithms Using Sampling Te...
Sort
View
ICPP
1998
IEEE
15 years 8 months ago
Routing Algorithms for Anycast Messages
Use of anycast service can considerably simplify many communication applications. Two approaches can be used for routing anycast packets. Single-path routing always uses the same ...
Dong Xuan, Weijia Jia, Wei Zhao
135
Voted
KDD
2008
ACM
199views Data Mining» more  KDD 2008»
16 years 4 months ago
Efficient computation of personal aggregate queries on blogs
There is an exploding amount of user-generated content on the Web due to the emergence of "Web 2.0" services, such as Blogger, MySpace, Flickr, and del.icio.us. The part...
Ka Cheung Sia, Junghoo Cho, Yun Chi, Belle L. Tsen...
131
Voted
ICRA
2007
IEEE
155views Robotics» more  ICRA 2007»
15 years 10 months ago
Swept Volume approximation of polygon soups
— We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume s...
Jesse C. Himmelstein, Etienne Ferre, Jean-Paul Lau...
123
Voted
MOBIWAC
2009
ACM
15 years 10 months ago
The sociable traveller: human travelling patterns in social-based mobility
Understanding how humans move is a key factor for the design and evaluation of networking protocols and mobility management solutions in mobile networks. This is particularly true...
Chiara Boldrini, Marco Conti, Andrea Passarella
179
Voted
DAMON
2008
Springer
15 years 5 months ago
CAM conscious integrated answering of frequent elements and top-k queries over data streams
Frequent elements and top-k queries constitute an important class of queries for data stream analysis applications. Certain applications require answers for both frequent elements...
Sudipto Das, Divyakant Agrawal, Amr El Abbadi