Sciweavers

2283 search results - page 406 / 457
» Bounds of Graph Characteristics
Sort
View
ECAI
2008
Springer
13 years 9 months ago
A Decomposition Technique for Max-CSP
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
Hachemi Bennaceur, Christophe Lecoutre, Olivier Ro...
LREC
2010
177views Education» more  LREC 2010»
13 years 9 months ago
Maskkot - An Entity-centric Annotation Platform
The Semantic Web is facing the important challenge to maintain its promise of a real world-wide graph of interconnected resources. Unfortunately, while URIs almost guarantee a dir...
Armando Stellato, Heiko Stoermer, Stefano Bortoli,...
SODA
2008
ACM
128views Algorithms» more  SODA 2008»
13 years 9 months ago
Analysis of greedy approximations with nonsubmodular potential functions
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
Ding-Zhu Du, Ronald L. Graham, Panos M. Pardalos, ...
SODA
2001
ACM
125views Algorithms» more  SODA 2001»
13 years 9 months ago
Parallel processor scheduling with delay constraints
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
Daniel W. Engels, Jon Feldman, David R. Karger, Ma...
ALENEX
2009
191views Algorithms» more  ALENEX 2009»
13 years 9 months ago
Theory and Practise of Monotone Minimal Perfect Hashing
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Seba...