Sciweavers

515 search results - page 37 / 103
» Approximating Markov Processes by Averaging
Sort
View
TKDE
2010
195views more  TKDE 2010»
14 years 10 months ago
Query Processing Using Distance Oracles for Spatial Networks
—The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as findin...
Jagan Sankaranarayanan, Hanan Samet
66
Voted
ICASSP
2008
IEEE
15 years 6 months ago
Approximate lower bounds for rate-distortion in compressive sensing systems
We attempt to quantify the possible gains that can be achieved by examining a rate-distortion competition between a conventional and a compressive sampling solution to data rate r...
Bernard Mulgrew, Michael E. Davies
CODES
2005
IEEE
15 years 5 months ago
Energy conscious online architecture adaptation for varying latency constraints in sensor network applications
Sensor network applications face continuously changing environments, which impose varying processing loads on the sensor node. This paper presents an online control method which a...
Sankalp Kallakuri, Alex Doboli
CICLING
2009
Springer
15 years 26 days ago
Generalized Mongue-Elkan Method for Approximate Text String Comparison
Abstract. The Mongue-Elkan method is a general text string comparison method based on an internal character-based similarity measure (e.g. edit distance) combined with a token leve...
Sergio Jimenez, Claudia Becerra, Alexander F. Gelb...
ICASSP
2010
IEEE
14 years 12 months ago
Stochastic cross-layer resource allocation for wireless networks using orthogonal access: Optimality and delay analysis
Efficient design of wireless networks requires implementation of cross-layer algorithms that exploit channel state information. Capitalizing on convex optimization and stochastic...
Antonio G. Marqués, Georgios B. Giannakis, ...