2100 search results - page 176 / 420 » Fundamentals of the problem |
108
click to vote
ESOP
2012
Springer
13 years 8 months ago
2012
Springer
Abstract. A behavioral contract in a higher-order language may invoke methods of unknown objects. Although this expressive power allows programmers to formulate sophisticated contr...
135
Voted
CVPR
2012
IEEE
13 years 3 months ago
2012
IEEE
Trajectory basis Non-Rigid Structure From Motion (NRSFM) currently faces two problems: the limit of reconstructability and the need to tune the basis size for different sequences....
119
Voted
ACL
2012
13 years 3 months ago
2012
Learning for sentence re-writing is a fundamental task in natural language processing and information retrieval. In this paper, we propose a new class of kernel functions, referre...
100
click to vote
EVOW
2009
Springer
15 years 7 months ago
2009
Springer
The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA, RNA or protein sequences while minimizing the number of evolutionary changes. Much work has been ...
114
click to vote
MKM
2009
Springer
15 years 7 months ago
2009
Springer
Methods for deciding quantifier-free non-linear arithmetical conjectures over R are crucial in the formal verification of many realworld systems and in formalised mathematics. Wh...