Sciweavers

473 search results - page 80 / 95
» Computing shortest paths with uncertainty
Sort
View
WIOPT
2005
IEEE
15 years 3 months ago
Minimum Energy Transmission Scheduling Subject to Deadline Constraints
We consider the problem of transmission scheduling of data over a wireless fading channel with hard deadline constraints. Our system consists of N users, each with a fixed amount...
Alessandro Tarello, Jun Sun 0007, Murtaza Zafer, E...
IPSN
2005
Springer
15 years 3 months 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
81
Voted
INFOCOM
2003
IEEE
15 years 2 months ago
Routing for Network Capacity Maximization in Energy-constrained Ad-hoc Networks
— We present a new algorithm for routing of messages in ad-hoc networks where the nodes are energy-constrained. The routing objective is to maximize the total number of messages ...
Koushik Kar, Murali S. Kodialam, T. V. Lakshman, L...
GIS
2009
ACM
15 years 2 months ago
Machine learning approach to report prioritization with an application to travel time dissemination
This paper looks at the problem of data prioritization, commonly found in mobile ad-hoc networks. The proposed general solution uses a machine learning approach in order to learn ...
Piotr Szczurek, Bo Xu, Jie Lin, Ouri Wolfson
75
Voted
VLDB
1998
ACM
144views Database» more  VLDB 1998»
15 years 1 months ago
Proximity Search in Databases
An information retrieval IR engine can rank documents based on textual proximityof keywords within each document. In this paper we apply this notion to search across an entire dat...
Roy Goldman, Narayanan Shivakumar, Suresh Venkatas...