Sciweavers

4378 search results - page 730 / 876
» On the Complexity of Ordered Colourings
Sort
View
SIGMOD
2005
ACM
143views Database» more  SIGMOD 2005»
16 years 6 months ago
Holistic Aggregates in a Networked World: Distributed Tracking of Approximate Quantiles
While traditional database systems optimize for performance on one-shot queries, emerging large-scale monitoring applications require continuous tracking of complex aggregates and...
Graham Cormode, Minos N. Garofalakis, S. Muthukris...
PODS
2007
ACM
171views Database» more  PODS 2007»
16 years 6 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
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...
ICDCS
2009
IEEE
16 years 3 months ago
Q-Tree: A Multi-Attribute Based Range Query Solution for Tele-immersive Framework
Users and administrators of large distributed systems are frequently in need of monitoring and management of its various components, data items and resources. Though there exist s...
Md. Ahsan Arefin, Md. Yusuf Sarwar Uddin, Indranil...
EUROSYS
2006
ACM
16 years 3 months ago
Thorough static analysis of device drivers
Bugs in kernel-level device drivers cause 85% of the system crashes in the Windows XP operating system [44]. One of the sources of these errors is the complexity of the Windows dr...
Thomas Ball, Ella Bounimova, Byron Cook, Vladimir ...