Sciweavers

6562 search results - page 264 / 1313
» Noetherianity and Combination Problems
Sort
View
KES
2006
Springer
15 years 6 months ago
A computational framework for package planning
We consider a novel class of applications where a set of activities conducted by a group of people over a time period needs to be planned, taking into account each member's p...
Yang Xiang, Michael Janzen
AAECC
2005
Springer
131views Algorithms» more  AAECC 2005»
15 years 6 months ago
Noisy interpolation of sparse polynomials in finite fields
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
Igor Shparlinski, Arne Winterhof
CC
2002
Springer
126views System Software» more  CC 2002»
15 years 6 months ago
On the hardness of approximating the permanent of structured matrices
We show that for several natural classes of "structured" matrices, including symmetric, circulant, Hankel and Toeplitz matrices, approximating the permanent modulo a prim...
Bruno Codenotti, Igor Shparlinski, Arne Winterhof
GIS
2010
ACM
15 years 5 months ago
An algorithmic framework for segmenting trajectories based on spatio-temporal criteria
In this paper we address the problem of segmenting a trajectory such that each segment is in some sense homogeneous. We formally define different spatio-temporal criteria under ...
Maike Buchin, Anne Driemel, Marc J. van Kreveld, V...
SBIA
2010
Springer
15 years 5 months ago
High-Level Modeling of Component-Based CSPs
Most of modern constraint modeling languages combine rich constraint languages with mathematical notations to tackle combinatorial optimization problems. Our purpose is to introduc...
Raphaël Chenouard, Laurent Granvilliers, Rica...