Sciweavers

3368 search results - page 262 / 674
» The Complexity of Query Reliability
Sort
View
SIGMOD
2008
ACM
139views Database» more  SIGMOD 2008»
16 years 6 months ago
SQAK: doing more with keywords
Today's enterprise databases are large and complex, often relating hundreds of entities. Enabling ordinary users to query such databases and derive value from them has been o...
Sandeep Tata, Guy M. Lohman
EDBT
2006
ACM
174views Database» more  EDBT 2006»
16 years 6 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
WDAG
1997
Springer
106views Algorithms» more  WDAG 1997»
15 years 10 months ago
Performing Tasks on Restartable Message-Passing Processors
Abstract. This work presents new algorithms for the "Do-All" problem that consists of performing t tasks reliably in a message-passing synchronous system of p fault-prone...
Bogdan S. Chlebus, Roberto De Prisco, Alexander A....
SOFTVIS
2006
ACM
16 years 17 days ago
Visualization of areas of interest in software architecture diagrams
Understanding complex software systems requires getting insight in how system properties, such as performance, trust, reliability, or structural attributes, correspond to the syst...
Heorhiy Byelas, Alexandru Telea
AIPS
2006
15 years 8 months ago
Explanation-Based Acquisition of Planning Operators
Classical planning algorithms require that their operators be simple in order for planning to be tractable. However, the complexities of real world domains suggest that, in order ...
Geoffrey Levine, Gerald DeJong