Sciweavers

2914 search results - page 386 / 583
» Learning and Inference with Constraints
Sort
View
STACS
2010
Springer
15 years 11 months ago
A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
Rustem Takhanov
KDD
2010
ACM
279views Data Mining» more  KDD 2010»
15 years 10 months ago
Unifying dependent clustering and disparate clustering for non-homogeneous data
Modern data mining settings involve a combination of attributevalued descriptors over entities as well as specified relationships between these entities. We present an approach t...
M. Shahriar Hossain, Satish Tadepalli, Layne T. Wa...
TOG
2002
98views more  TOG 2002»
15 years 6 months ago
Synthesis of complex dynamic character motion from simple animations
In this paper we present a general method for rapid prototyping of realistic character motion. We solve for the natural motion from a simple animation provided by the animator. Ou...
C. Karen Liu, Zoran Popovic
MP
2011
15 years 1 months ago
Null space conditions and thresholds for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
SIGSOFT
2003
ACM
16 years 7 months ago
ARCHER: using symbolic, path-sensitive analysis to detect memory access errors
Memory corruption errors lead to non-deterministic, elusive crashes. This paper describes ARCHER (ARray CHeckER) a static, effective memory access checker. ARCHER uses path-sensit...
Yichen Xie, Andy Chou, Dawson R. Engler