Sciweavers

2489 search results - page 470 / 498
» On the Subgroup Distance Problem
Sort
View
SIGMOD
2001
ACM
108views Database» more  SIGMOD 2001»
14 years 7 months ago
PREFER: A System for the Efficient Execution of Multi-parametric Ranked Queries
Users often need to optimize the selection of objects by appropriately weighting the importance of multiple object attributes. Such optimization problems appear often in operation...
Vagelis Hristidis, Nick Koudas, Yannis Papakonstan...
MOBISYS
2008
ACM
14 years 7 months ago
Detecting energy-greedy anomalies and mobile malware variants
Mobile users of computation and communication services have been rapidly adopting battery-powered mobile handhelds, such as PocketPCs and SmartPhones, for their work. However, the...
Hahnsang Kim, Joshua Smith, Kang G. Shin
MOBIHOC
2008
ACM
14 years 7 months ago
Localized distance-sensitive service discovery in wireless sensor networks
In this paper, we identify a new problem in wireless sensor networks, distance sensitive service discovery, where nearby or closest service selection guarantee is expected. We pro...
Xu Li, Nicola Santoro, Ivan Stojmenovic
MOBIHOC
2005
ACM
14 years 7 months ago
Link-layer salvaging for making routing progress in mobile ad hoc networks
IEEE 802.11 MAC, called the Distributed Coordination Function (DCF), employs carrier sensing to effectively avoid collisions, but this makes it difficult to maximally reuse the sp...
Chansu Yu, Kang G. Shin, Lubo Song
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
14 years 4 months ago
Efficient Broadcast on Random Geometric Graphs
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
Milan Bradonji, Robert Elsässer, Tobias Friedrich...