Sciweavers

458 search results - page 22 / 92
» Fast and Simple Relational Processing of Uncertain Data
Sort
View
INFOCOM
2006
IEEE
14 years 1 months ago
Super-Fast Delay Tradeoffs for Utility Optimal Fair Scheduling in Wireless Networks
— We consider the fundamental delay tradeoffs for utility optimal scheduling in a general network with time varying channels. A network controller acts on randomly arriving data ...
Michael J. Neely
ALENEX
2007
127views Algorithms» more  ALENEX 2007»
13 years 9 months ago
Intersection in Integer Inverted Indices
Inverted index data structures are the key to fast search engines. The predominant operation on inverted indices asks for intersecting two sorted lists of document IDs which might...
Peter Sanders, Frederik Transier
WWW
2005
ACM
14 years 8 months ago
A fast XPATH evaluation technique with the facility of updates
This paper addresses the problem of fast retrieval of data from XML documents by providing a labeling schema that can easily handle simple as well as complex XPATH queries and als...
Ashish Virmani, Suchit Agarwal, Rahul Thathoo, She...
CCA
2009
Springer
14 years 7 days ago
From Interval Computations to Constraint-Related Set Computations: Towards Faster Estimation of Statistics and ODEs under Interv
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
Vladik Kreinovich
DASFAA
2009
IEEE
195views Database» more  DASFAA 2009»
14 years 2 months ago
The XMLBench Project: Comparison of Fast, Multi-platform XML libraries
The XML technologies have brought a lot of new ideas and abilities in the field of information management systems. Nowadays, XML is used almost everywhere: from small configurati...
Suren Chilingaryan