Sciweavers

90 search results - page 14 / 18
» A swarm based approximated algorithm to the extended general...
Sort
View
COMPGEOM
2008
ACM
13 years 9 months ago
Maximum thick paths in static and dynamic environments
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
Esther M. Arkin, Joseph S. B. Mitchell, Valentin P...
GIS
2007
ACM
14 years 8 months ago
Dynamics-aware similarity of moving objects trajectories
This work addresses the problem of obtaining the degree of similarity between trajectories of moving objects. Typically, a Moving Objects Database (MOD) contains sequences of (loc...
Goce Trajcevski, Hui Ding, Peter Scheuermann, Robe...
MOBIHOC
2010
ACM
13 years 5 months ago
On quality of monitoring for multi-channel wireless infrastructure networks
Passive monitoring utilizing distributed wireless sniffers is an effective technique to monitor activities in wireless infrastructure networks for fault diagnosis, resource manage...
Arun Chhetri, Huy Anh Nguyen, Gabriel Scalosub, Ro...
ICDE
2007
IEEE
162views Database» more  ICDE 2007»
14 years 8 months ago
On Density Based Transforms for Uncertain Data Mining
In spite of the great progress in the data mining field in recent years, the problem of missing and uncertain data has remained a great challenge for data mining algorithms. Many ...
Charu C. Aggarwal
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
14 years 8 months ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...