Sciweavers

3154 search results - page 108 / 631
» Computing Closed Skycubes
Sort
View
SAC
2008
ACM
15 years 2 months ago
A constraint hierarchies approach to geometric constraints on sketches
We propose an approach that uses preferences on the constraints in order to deal with over-constrained geometric constraint problems. This approach employs constraint hierarchies,...
Christophe Jermann, Hiroshi Hosobe
SAC
2008
ACM
15 years 2 months ago
Extending peer-to-peer networks for approximate search
This paper proposes a way to enable approximate queries in a peer-to-peer network by using a special encoding function and error correcting codes. The encoding function maintains ...
Alain Mowat, Roman Schmidt, Michael Schumacher, Io...
TCS
2010
15 years 1 months ago
CSP duality and trees of bounded pathwidth
We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the use of non-linearity. We show how such problems can be described in terms of...
Catarina Carvalho, Víctor Dalmau, Andrei A....
WG
2010
Springer
15 years 23 days ago
Efficient Algorithms for Eulerian Extension
Eulerian extension problems aim at making a given (directed) (multi-)graph Eulerian by adding a minimum-cost set of edges (arcs). These problems have natural applications in schedu...
Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mat...
CORR
2010
Springer
102views Education» more  CORR 2010»
15 years 9 days ago
A contribution to the conditioning of the total least squares problem
We derive closed formulas for the condition number of a linear function of the total least squares solution. Given an over determined linear systems Ax = b, we show that this condi...
Marc Baboulin, Serge Gratton