Sciweavers

AAAI
2004
13 years 6 months ago
The Complexity of Global Constraints
We study the computational complexity of reasoning with global constraints. We show that reasoning with such constraints is intractable in general. We then demonstrate how the sam...
Christian Bessière, Emmanuel Hebrard, Brahi...
PDPTA
2008
13 years 6 months ago
A Parallel Processing Architecture for Solving Large-Scale Linear Systems
Solving linear systems with a large number of variables is at the core of many scienti c problems. Parallel processing techniques for solving such systems have received much attent...
Arun Nagari, Itamar Elhanany, Ben Thompson, Fangxi...
NIPS
2008
13 years 6 months ago
Near-minimax recursive density estimation on the binary hypercube
This paper describes a recursive estimation procedure for multivariate binary densities using orthogonal expansions. For d covariates, there are 2d basis coefficients to estimate,...
Maxim Raginsky, Svetlana Lazebnik, Rebecca Willett...
IJCAI
2007
13 years 6 months ago
Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
Electoral control refers to attempts by an election’s organizer (“the chair”) to influence the outcome by adding/deleting/partitioning voters or candidates. The groundbreak...
Edith Hemaspaandra, Lane A. Hemaspaandra, Jör...
ESANN
2007
13 years 6 months ago
Adaptive Global Metamodeling with Neural Networks
Due to the scale and computational complexity of current simulation codes, metamodels (or surrogate models) have become indispensable tools for exploring and understanding the desi...
Dirk Gorissen, Wouter Hendrickx, Tom Dhaene
CCCG
2007
13 years 6 months ago
On Rolling Cube Puzzles
We analyze the computational complexity of various rolling cube puzzles.
Kevin Buchin, Maike Buchin, Erik D. Demaine, Marti...
FCT
2007
Springer
13 years 6 months ago
On the Complexity of Kings
The diameter of an undirected graph is the minimal number d such that there is a path between any two vertices of the graph of length at most d. The radius of a graph is the minim...
Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tan...
CP
2008
Springer
13 years 6 months ago
A Soft Constraint of Equality: Complexity and Approximability
We introduce the SoftAllEqual global constraint, which maximizes the number of equalities holding between pairs of assignments to a set of variables. We study the computational com...
Emmanuel Hebrard, Barry O'Sullivan, Igor Razgon
CODES
2006
IEEE
13 years 6 months ago
Efficient computation of buffer capacities for multi-rate real-time systems with back-pressure
A key step in the design of multi-rate real-time systems is the determination of buffer capacities. In our multi-processor system, we apply back-pressure as caused by bounded buff...
Maarten Wiggers, Marco Bekooij, Pierre G. Jansen, ...
3DIM
2005
IEEE
13 years 6 months ago
Projection-Based Registration Using a Multi-View Camera for Indoor Scene Reconstruction
A registration method is proposed for 3D reconstruction of an indoor environment using a multi-view camera. In general, previous methods have a high computational complexity and a...
Sehwan Kim, Woontack Woo