Sciweavers

160 search results - page 19 / 32
» Approximability of Manipulating Elections
Sort
View
SLP
1994
121views more  SLP 1994»
13 years 11 months ago
CLP(Intervals) Revisited
The design and implementation of constraint logic programming (CLP) languages over intervals is revisited. Instead of decomposing complex constraints in terms of simple primitive ...
Frédéric Benhamou, David A. McAllest...
CG
2006
Springer
13 years 9 months ago
From spline to Class-A curves through multi-scale analysis filtering
This paper reports the work on a novel wavelet-based multi-scale filtering application used to generate very smooth subset of profiles known as Class-A curves. The multi-scale rep...
Giancarlo Amati, Alfredo Liverani, Gianni Caligian...
ICASSP
2011
IEEE
13 years 1 months ago
Generalizations of Blom And Bloem's PDF decomposition for permutation-invariant estimation
Minimum mean squared error estimates generally are not optimal in terms of a common track error statistic used in tracking benchmarks, namely a form of the Mean Optimal Subpattern...
David Frederic Crouse, Peter Willett, Yaakov Bar-S...
ISSAC
2007
Springer
130views Mathematics» more  ISSAC 2007»
14 years 3 months ago
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
Erich Kaltofen, Zhengfeng Yang, Lihong Zhi
WEBI
2005
Springer
14 years 3 months ago
Aligning Class Hierarchies with Grass-Roots Class Alignment
The performance of an ontology alignment technique largely depends on the amount of information that can be leveraged for the alignment task. On the Semantic Web, end-users may ex...
Baoshi Yan