Sciweavers

236 search results - page 28 / 48
» Binary Partitions Revisited
Sort
View
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
15 years 4 months ago
Tight Results on Minimum Entropy Set Cover
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
Jean Cardinal, Samuel Fiorini, Gwenaël Joret
ENTCS
2006
112views more  ENTCS 2006»
15 years 21 days ago
Distributed Symbolic Bounded Property Checking
In this paper we describe an algorithm for distributed, BDD-based bounded property checking and its implementation in the verification tool SymC. The distributed algorithm verifie...
Pradeep Kumar Nalla, Roland J. Weiss, Prakash Moha...
98
Voted
AUTOMATICA
2006
166views more  AUTOMATICA 2006»
15 years 22 days ago
On admissible pairs and equivalent feedback - Youla parameterization in iterative learning control
This paper revisits a well-known synthesis problem in iterative learning control, where the objective is to optimize a performance criterion over a class of causal iterations. The...
Mark Verwoerd, Gjerrit Meinsma, Theo de Vries
ICDE
2012
IEEE
196views Database» more  ICDE 2012»
13 years 3 months ago
Scalable Multi-query Optimization for SPARQL
Abstract—This paper revisits the classical problem of multiquery optimization in the context of RDF/SPARQL. We show that the techniques developed for relational and semi-structur...
Wangchao Le, Anastasios Kementsietsidis, Songyun D...
98
Voted
DCC
2002
IEEE
16 years 8 days ago
PPMexe: PPM for Compressing Software
With the emergence of software delivery platforms such as Microsoft's .NET, code compression has become one of the core enabling technologies strongly affecting system perfor...
Milenko Drinic, Darko Kirovski