Sciweavers

2914 search results - page 505 / 583
» Learning and Inference with Constraints
Sort
View
ACL
2006
13 years 11 months ago
Bootstrapping Path-Based Pronoun Resolution
We present an approach to pronoun resolution based on syntactic paths. Through a simple bootstrapping procedure, we learn the likelihood of coreference between a pronoun and a can...
Shane Bergsma, Dekang Lin
ACE
2003
130views Education» more  ACE 2003»
13 years 11 months ago
Bootstrapping Computer Science in Old North Wales
We describe our experiences in setting up a new Computer Science department in an established University within the UK. We drew upon our experiences in teaching Computing in Austr...
Kenneth A. Hawick, Heath A. James
NIPS
2004
13 years 11 months ago
Triangle Fixing Algorithms for the Metric Nearness Problem
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp
AAAI
2000
13 years 11 months ago
Applying Learnable Evolution Model to Heat Exchanger Design
A new approach to evolutionary computation, called Learnable Evolution Model (LEM), has been applied to the problem of optimizing tube structures of heat exchangers. In contrast t...
Kenneth A. Kaufman, Ryszard S. Michalski
AAAI
1997
13 years 11 months ago
Using CSP Look-Back Techniques to Solve Real-World SAT Instances
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
Roberto J. Bayardo Jr., Robert Schrag