Sciweavers

4372 search results - page 685 / 875
» Algorithmic Theories of Everything
Sort
View
ICDT
2005
ACM
130views Database» more  ICDT 2005»
16 years 3 days ago
Rewriting Queries Using Views with Access Patterns Under Integrity Constraints
We study the problem of rewriting queries using views in the presence of access patterns, integrity constraints, disjunction, and negation. We provide asymptotically optimal algori...
Alin Deutsch, Bertram Ludäscher, Alan Nash
IWQOS
2005
Springer
16 years 2 days ago
A High-Throughput Overlay Multicast Infrastructure with Network Coding
Network coding has been recently proposed in information theory as a new dimension of the information multicast problem that helps achieve optimal transmission rate or cost. End ho...
Mea Wang, Zongpeng Li, Baochun Li
KDD
2005
ACM
127views Data Mining» more  KDD 2005»
16 years 2 days ago
Mining closed relational graphs with connectivity constraints
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
Xifeng Yan, Xianghong Jasmine Zhou, Jiawei Han
MICAI
2005
Springer
16 years 2 days ago
Directed Cycles in Bayesian Belief Networks: Probabilistic Semantics and Consistency Checking Complexity
Although undirected cycles in directed graphs of Bayesian belief networks have been thoroughly studied, little attention has so far been given to a systematic analysis of directed ...
Alexander L. Tulupyev, Sergey I. Nikolenko
NOSSDAV
2005
Springer
16 years 2 days ago
Using n-trees for scalable event ordering in peer-to-peer games
We are concerned with the fundamental problem of event ordering in multiplayer peer-to-peer games. Event ordering, even without faults, requires all-to-all message passing with at...
Chris GauthierDickey, Virginia Mary Lo, Daniel Zap...