Sciweavers

534 search results - page 104 / 107
» Proving Termination of Rewrite Systems Using Bounds
Sort
View
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 8 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
IPL
2010
119views more  IPL 2010»
13 years 7 months ago
Note on Max Lin-2 above Average
In the Max Lin-2 problem we are given a system S of m linear equations in n variables over F2 in which Equation j is assigned a positive integral weight wj for each j. We wish to ...
Robert Crowston, Gregory Gutin, Mark Jones
ESOP
2005
Springer
14 years 2 months ago
Asserting Bytecode Safety
Abstract. We instantiate an Isabelle/HOL framework for proof carrying code to Jinja bytecode, a downsized variant of Java bytecode featuring objects, inheritance, method calls and ...
Martin Wildmoser, Tobias Nipkow
WAW
2004
Springer
178views Algorithms» more  WAW 2004»
14 years 2 months ago
Communities Detection in Large Networks
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
Andrea Capocci, Vito Domenico Pietro Servedio, Gui...
CORR
2011
Springer
145views Education» more  CORR 2011»
13 years 3 months ago
MDS Array Codes with Optimal Rebuilding
—MDS array codes are widely used in storage systems to protect data against erasures. We address the rebuilding ratio problem, namely, in the case of erasures, what is the the fr...
Itzhak Tamo, Zhiying Wang, Jehoshua Bruck