Sciweavers

2314 search results - page 343 / 463
» Minimal Partitions of a Graph
Sort
View
107
Voted
EDBT
2008
ACM
106views Database» more  EDBT 2008»
16 years 3 months ago
Highly scalable trip grouping for large-scale collective transportation systems
Transportation?related problems, like road congestion, parking, and pollution, are increasing in most cities. In order to reduce traffic, recent work has proposed methods for vehi...
Gyözö Gidófalvi, Torben Bach Pede...
149
Voted
STACS
2007
Springer
15 years 9 months ago
Small Space Representations for Metric Min-Sum k -Clustering and Their Applications
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
Artur Czumaj, Christian Sohler
ITCC
2005
IEEE
15 years 9 months ago
A Framework for Key Management in Mobile Ad Hoc Networks
Background: Key management in a mobile ad hoc environment is complicated by frequently partitioning network topology. Recently proposed key management systems (KMSs) provide limit...
George C. Hadjichristofi, William Joseph Adams, Na...
IPSN
2005
Springer
15 years 9 months ago
Quantizer design and distributed encoding algorithm for source localization in sensor networks
— In this paper, we propose a quantizer design algorithm that is optimized for source localization in sensor networks. For this application, the goal is to minimize the amount of...
Yoon Hak Kim, Antonio Ortega
MSWIM
2003
ACM
15 years 9 months ago
On the application of traffic engineering over bluetooth ad hoc networks
The seamless communication of data and voice over short-range, point-to-multipoint wireless links between mobile and/or stationary devices is becoming a reality by newly introduce...
Sachin Abhyankar, Rishi Toshniwal, Carlos de M. Co...