Sciweavers

491 search results - page 57 / 99
» Linear Quantifier Elimination
Sort
View
CONSTRAINTS
2010
193views more  CONSTRAINTS 2010»
13 years 6 months ago
Constraint propagation on quadratic constraints
This paper considers constraint propagation methods for continuous constraint satisfaction problems consisting of linear and quadratic constraints. All methods can be applied after...
Ferenc Domes, Arnold Neumaier
IJCAI
1997
13 years 10 months ago
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
Rina Dechter
ICMCS
2010
IEEE
178views Multimedia» more  ICMCS 2010»
13 years 10 months ago
Channel smurfing: Minimising channel switching delay in IPTV distribution networks
One of the major concerns of IPTV network deployment is channel switching (or zapping) delay. This delay can add up to two seconds or more, and its main culprits are synchronisati...
Fernando M. V. Ramos, Jon Crowcroft, Richard J. Gi...
ICCV
2003
IEEE
14 years 10 months ago
Learning a Locality Preserving Subspace for Visual Recognition
Previous works have demonstrated that the face recognition performance can be improved significantly in low dimensional linear subspaces. Conventionally, principal component analy...
Xiaofei He, Shuicheng Yan, Yuxiao Hu, HongJiang Zh...
CAV
2007
Springer
116views Hardware» more  CAV 2007»
14 years 3 months ago
A Decision Procedure for Bit-Vectors and Arrays
Abstract. STP is a decision procedure for the satisfiability of quantifier-free formulas in the theory of bit-vectors and arrays that has been optimized for large problems encoun...
Vijay Ganesh, David L. Dill