697 search results - page 105 / 140 » On the Theory of Average Case Complexity |
PODS
2008
ACM
14 years 8 months ago
2008
ACM
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
TLDI
2010
ACM
14 years 4 months ago
2010
ACM
In the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even th...
LATA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We consider policies that are described by regular expressions, finite automata, or formulae of linear temporal logic (LTL). Such policies are assumed to describe situat...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...
HICSS
2008
IEEE
14 years 2 months ago
2008
IEEE
Governments are increasingly using collaborative, cross-boundary strategies to face complex social problems. Many of these cross-boundary initiatives have at their core the use, a...