Sciweavers

476 search results - page 56 / 96
» The Complexity of Equality Constraint Languages
Sort
View
ASPLOS
2011
ACM
13 years 1 months ago
Blink: managing server clusters on intermittent power
Reducing the energy footprint of data centers continues to receive significant attention due to both its financial and environmental impact. There are numerous methods that limi...
Navin Sharma, Sean Barker, David Irwin, Prashant J...
CSDA
2006
72views more  CSDA 2006»
13 years 10 months ago
Generalized theory of uncertainty (GTU) - principal concepts and ideas
Uncertainty is an attribute of information. The path-breaking work of Shannon has led to a universal acceptance of the thesis that information is statistical in nature. Concomitan...
Lotfi A. Zadeh
ESOP
2009
Springer
14 years 1 months ago
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
Hao Yuan, Patrick Th. Eugster
SIGMOD
2009
ACM
158views Database» more  SIGMOD 2009»
14 years 10 months ago
Simplifying XML schema: effortless handling of nondeterministic regular expressions
Whether beloved or despised, XML Schema is momentarily the only industrially accepted schema language for XML and is unlikely to become obsolete any time soon. Nevertheless, many ...
Geert Jan Bex, Wouter Gelade, Wim Martens, Frank N...
DBPL
2001
Springer
115views Database» more  DBPL 2001»
14 years 2 months ago
Optimization Properties for Classes of Conjunctive Regular Path Queries
Abstract. We are interested in the theoretical foundations of the optimization of conjunctive regular path queries (CRPQs). The basic problem here is deciding query containment bot...
Alin Deutsch, Val Tannen