Sciweavers

1941 search results - page 117 / 389
» On Generalizations of Network Design Problems with Degree Bo...
Sort
View
CIKM
2006
Springer
15 years 1 months ago
Distributed spatio-temporal similarity search
In this paper we introduce the distributed spatio-temporal similarity search problem: given a query trajectory Q, we want to find the trajectories that follow a motion similar to ...
Demetrios Zeinalipour-Yazti, Song Lin, Dimitrios G...
TPDS
2008
136views more  TPDS 2008»
14 years 10 months ago
Data Gathering with Tunable Compression in Sensor Networks
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
Yang Yu, Bhaskar Krishnamachari, Viktor K. Prasann...
MM
2004
ACM
165views Multimedia» more  MM 2004»
15 years 3 months ago
Predictive perceptual compression for real time video communication
Approximately 2 degrees in our 140 degree vision span has sharp vision. Many researchers have been fascinated by the idea of eyetracking integrated perceptual compression of an im...
Oleg Komogortsev, Javed I. Khan
WEA
2007
Springer
95views Algorithms» more  WEA 2007»
15 years 4 months ago
Experimental Evaluation of Parametric Max-Flow Algorithms
The parametric maximum flow problem is an extension of the classical maximum flow problem in which the capacities of certain arcs are not fixed but are functions of a single par...
Maxim A. Babenko, Jonathan Derryberry, Andrew V. G...
MOBICOM
2012
ACM
13 years 13 days ago
Temporal reachability graphs
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
John Whitbeck, Marcelo Dias de Amorim, Vania Conan...