Sciweavers

2783 search results - page 225 / 557
» The Nature Of Near-Synonymic Relations
Sort
View
JCDL
2003
ACM
119views Education» more  JCDL 2003»
15 years 7 months ago
Genescene: Biomedical Text And Data Mining
To access the content of digital texts efficiently, it is necessary to provide more sophisticated access than keyword based searching. Genescene provides biomedical researchers wi...
Gondy Leroy, Hsinchun Chen, Jesse D. Martinez, Sha...
ICALP
2010
Springer
15 years 6 months ago
Preprocessing of Min Ones Problems: A Dichotomy
Min Ones Constraint Satisfaction Problems, i.e., the task of finding a satisfying assignment with at most k true variables (Min Ones SAT(Γ)), can express a number of interesting ...
Stefan Kratsch, Magnus Wahlström
KR
2000
Springer
15 years 5 months ago
Anytime Diagnostic Reasoning using Approximate Boolean Constraint Propagation
In contrast with classical reasoning, where a solution is either correct or incorrect, approximate reasoning tries to compute solutions which are close to the ideal solution, with...
Alan Verberne, Frank van Harmelen, Annette ten Tei...
APPROX
2010
Springer
138views Algorithms» more  APPROX 2010»
15 years 3 months ago
Improved Rounding for Parallel Repeated Unique Games
We show a tight relation between the behavior of unique games under parallel repetition and their semidefinite value. Let G be a unique game with alphabet size k. Suppose the semid...
David Steurer
ACL
2008
15 years 3 months ago
Efficient, Feature-based, Conditional Random Field Parsing
Discriminative feature-based methods are widely used in natural language processing, but sentence parsing is still dominated by generative methods. While prior feature-based dynam...
Jenny Rose Finkel, Alex Kleeman, Christopher D. Ma...