Sciweavers

4698 search results - page 451 / 940
» Making Functionality More General
Sort
View
TCS
2008
15 years 6 months ago
Expanders and time-restricted branching programs
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...
Stasys Jukna
ALGORITHMICA
1998
184views more  ALGORITHMICA 1998»
15 years 6 months ago
Approximation Algorithms for Connected Dominating Sets
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
Sudipto Guha, Samir Khuller
DAM
1998
88views more  DAM 1998»
15 years 6 months ago
Neither Reading Few Bits Twice Nor Reading Illegally Helps Much
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing...
Stasys Jukna, Alexander A. Razborov
ECAI
2010
Springer
15 years 4 months ago
Adaptive Markov Logic Networks: Learning Statistical Relational Models with Dynamic Parameters
Abstract. Statistical relational models, such as Markov logic networks, seek to compactly describe properties of relational domains by representing general principles about objects...
Dominik Jain, Andreas Barthels, Michael Beetz
ICDT
2011
ACM
270views Database» more  ICDT 2011»
14 years 10 months ago
On the equivalence of distributed systems with queries and communication
Distributed data management systems consist of peers that store, exchange and process data in order to collaboratively achieve a common goal, such as evaluate some query. We study...
Serge Abiteboul, Balder ten Cate, Yannis Katsis