Sciweavers

4860 search results - page 586 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
ACL
2003
15 years 6 months ago
Syntactic Features and Word Similarity for Supervised Metonymy Resolution
We present a supervised machine learning algorithm for metonymy resolution, which exploits the similarity between examples of conventional metonymy. We show that syntactic head-mo...
Malvina Nissim, Katja Markert
IJCAI
2001
15 years 6 months ago
Market Clearability
Market mechanisms play a central role in AI as a coordination tool in multiagent systems and as an application area for algorithm design. Mechanisms where buyers are directly clea...
Tuomas Sandholm, Subhash Suri
160
Voted
NIPS
2004
15 years 6 months ago
Euclidean Embedding of Co-Occurrence Data
Embedding algorithms search for low dimensional structure in complex data, but most algorithms only handle objects of a single type for which pairwise distances are specified. Thi...
Amir Globerson, Gal Chechik, Fernando C. Pereira, ...
WSCG
2004
142views more  WSCG 2004»
15 years 6 months ago
Metropolis Iteration for Global Illumination
This paper presents a stochastic iteration algorithm solving the global illumination problem, where the random sampling is governed by classical importance sampling and also by th...
László Szirmay-Kalos, Bálazs ...
136
Voted
IJCAI
1997
15 years 6 months ago
Equational Reasoning using AC Constraints
Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generate...
David A. Plaisted, Yunshan Zhu