Sciweavers

11345 search results - page 2210 / 2269
» Foundations of Computer Science
Sort
View
LICS
2008
IEEE
15 years 5 months ago
On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
Søren Riis
WMCSA
2008
IEEE
15 years 5 months ago
HealthSense: classification of health-related sensor data through user-assisted machine learning
Remote patient monitoring generates much more data than healthcare professionals are able to manually interpret. Automated detection of events of interest is therefore critical so...
Erich P. Stuntebeck, John S. Davis II, Gregory D. ...
AIMSA
2008
Springer
15 years 5 months ago
Noun Compound Interpretation Using Paraphrasing Verbs: Feasibility Study
Abstract. The paper addresses an important challenge for the automatic processing of English written text: understanding noun compounds’ semantics. Following Downing (1977) [1], ...
Preslav Nakov
ISCA
2007
IEEE
196views Hardware» more  ISCA 2007»
15 years 5 months ago
Anton, a special-purpose machine for molecular dynamics simulation
The ability to perform long, accurate molecular dynamics (MD) simulations involving proteins and other biological macromolecules could in principle provide answers to some of the ...
David E. Shaw, Martin M. Deneroff, Ron O. Dror, Je...
LICS
2007
IEEE
15 years 5 months ago
Game Relations and Metrics
We consider two-player games played over finite state spaces for an infinite number of rounds. At each state, the players simultaneously choose moves; the moves determine a succ...
Luca de Alfaro, Rupak Majumdar, Vishwanath Raman, ...
« Prev « First page 2210 / 2269 Last » Next »