Sciweavers

1263 search results - page 192 / 253
» A* with Bounded Costs
Sort
View
IPSN
2005
Springer
14 years 1 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
VLDB
2005
ACM
106views Database» more  VLDB 2005»
14 years 1 months ago
Adaptive Stream Filters for Entity-based Queries with Non-Value Tolerance
We study the problem of applying adaptive filters for approximate query processing in a distributed stream environment. We propose filter bound assignment protocols with the obj...
Reynold Cheng, Ben Kao, Sunil Prabhakar, Alan Kwan...
WEA
2005
Springer
120views Algorithms» more  WEA 2005»
14 years 1 months ago
Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms
Abstract. We consider the problem of fast IP address lookup in the forwarding engines of Internet routers. We analyze over 2400 public snapshots of routing tables collected over ...
Filippo Geraci, Roberto Grossi
WEBDB
2005
Springer
83views Database» more  WEBDB 2005»
14 years 1 months ago
Indexing for XML Siblings
Efficient querying XML documents is an increasingly important issue considering the fact that XML becomes the de facto standard for data representation and exchange over the Web,...
SungRan Cho
APWEB
2004
Springer
14 years 1 months ago
Using Relational Database Constraints to Design Materialized Views in Data Warehouses
Queries to data warehouses often involve hundreds of complex aggregations over large volumes of data, and so it is infeasible to compute these queries by scanning the data sources ...
Taehee Lee, Jae-young Chang, Sang-goo Lee