Sciweavers

68 search results - page 5 / 14
» Obtaining Quick Results for Approximate Answers
Sort
View
ASSETS
2007
ACM
13 years 11 months ago
SADIe: exposing implicit information to improve accessibility
The World Wide Web (Web) is a visually complex, multimedia system that can be inaccessible to people with visual impairments. SADIe addresses this problem by using Semantic Web te...
Darren Lunn
QOSIP
2005
Springer
14 years 1 months ago
Unicast and Multicast QoS Routing with Multiple Constraints
Abstract. We explore techniques for efficient Quality of Service Routing in the presence of multiple constraints. We first present a polynomial time approximation algorithm for th...
Dan Wang, Funda Ergün, Zhan Xu
COMPGEOM
2009
ACM
14 years 2 months ago
A general approach for cache-oblivious range reporting and approximate range counting
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...
Peyman Afshani, Chris H. Hamilton, Norbert Zeh
APPROX
2009
Springer
149views Algorithms» more  APPROX 2009»
14 years 2 months ago
On the Complexity of the Asymmetric VPN Problem
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
Thomas Rothvoß, Laura Sanità
IS
2006
13 years 7 months ago
Processing approximate aggregate queries in wireless sensor networks
In-network data aggregation has been recently proposed as an effective means to reduce the number of messages exchanged in wireless sensor networks. Nodes of the network form an a...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...