Sciweavers

333 search results - page 14 / 67
» Computation with Absolutely No Space Overhead
Sort
View
VLDB
2007
ACM
103views Database» more  VLDB 2007»
14 years 10 months ago
On the Production of Anorexic Plan Diagrams
A "plan diagram" is a pictorial enumeration of the execution plan choices of a database query optimizer over the relational selectivity space. We have shown recently tha...
Harish D., Pooja N. Darera, Jayant R. Haritsa
AI
2006
Springer
14 years 1 months ago
Exploiting Dynamic Independence in a Static Conditioning Graph
Abstract. A conditioning graph (CG) is a graphical structure that attempt to minimize the implementation overhead of computing probabilities in belief networks. A conditioning grap...
Kevin Grant, Michael C. Horsch
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 10 months ago
Information Distance
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distan...
Charles H. Bennett, Péter Gács, Ming...
MOBISYS
2005
ACM
14 years 9 months ago
Deploying and evaluating a location-aware system
Location-aware systems are typically deployed on a small scale and evaluated technically, in terms of absolute errors. In this paper, the authors present their experience of deplo...
Robert K. Harle, Andy Hopper
EDCC
2006
Springer
14 years 1 months ago
Construction of a Highly Dependable Operating System
It has been well established that most operating system crashes are due to bugs in device drivers. Because drivers are normally linked into the kernel address space, a buggy drive...
Jorrit N. Herder, Herbert Bos, Ben Gras, Philip Ho...