Sciweavers

2796 search results - page 348 / 560
» The coolest path problem
Sort
View
DCOSS
2005
Springer
16 years 2 days ago
Routing Explicit Side Information for Data Compression in Wireless Sensor Networks
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
Huiyu Luo, Gregory J. Pottie
IPSN
2005
Springer
16 years 1 days ago
Lossy network correlated data gathering with high-resolution coding
— We consider a sensor network measuring correlated data, where the task is to gather all data from the network nodes to a sink. We consider the case where data at nodes is lossy...
Razvan Cristescu, Baltasar Beferull-Lozano
KI
2005
Springer
16 years 1 days ago
Temporalizing Spatial Calculi: On Generalized Neighborhood Graphs
To reason about geographical objects, it is not only necessary to have more or less complete information about where these objects are located in space, but also how they can chang...
Marco Ragni, Stefan Wölfl
WINE
2005
Springer
122views Economy» more  WINE 2005»
16 years 9 hour ago
Walrasian Equilibrium: Hardness, Approximations and Tractable Instances
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
Ning Chen, Atri Rudra
WIDM
2004
ACM
15 years 12 months ago
Querying structured data in an unstructured P2P system
Abstract— Peer-to-Peer networking has become a major research topic over the last few years. Sharing of structured data in such decentralized environments is a challenging proble...
Verena Kantere, Dimitrios Tsoumakos, Nick Roussopo...