753 search results - page 63 / 151 » Completing a (k - 1)-Assignment |
102
click to vote
VMV
2003
14 years 11 months ago
2003
There are many nearest neighbor algorithms tailormade for ICP, but most of them require special input data like range images or triangle meshes. We focus on efficient nearest nei...
IJCAI
1997
14 years 11 months ago
1997
Evaluation of incomplete algorithms that solve SAT requires to generate hard satisfiable instances. For that purpose, the kSAT uniform random generation is not usable. The other g...
WSC
1998
14 years 11 months ago
1998
In this paper, an efficient simulation environment that utilizes compiler techniques to speed up simulation is presented. The method is based on the utilization of flexible, proce...
ACL
1989
14 years 11 months ago
1989
Feature structures are informational elements that have been used in several linguistic theories and in computational systems for natural-language processing. A logicaJ calculus h...
ICML
2010
IEEE
14 years 11 months ago
2010
IEEE
The structure of a Markov network is typically learned using top-down search. At each step, the search specializes a feature by conjoining it to the variable or feature that most ...