Sciweavers

556 search results - page 74 / 112
» Pair Programming: Not for Everyone
Sort
View
ACL
2008
13 years 10 months ago
Enforcing Transitivity in Coreference Resolution
A desirable quality of a coreference resolution system is the ability to handle transitivity constraints, such that even if it places high likelihood on a particular mention being...
Jenny Rose Finkel, Christopher D. Manning
BIOCOMP
2009
13 years 10 months ago
Consensus RNA Secondary Structure Prediction by Ranking k-Length Stems
The accurate computational prediction of RNA secondary structures is a difficult task, but an important one, since RNA structure is usually more evolutionarily conserved than prima...
Denise Y. F. Mak, Gary Benson
DSD
2010
IEEE
161views Hardware» more  DSD 2010»
13 years 9 months ago
Design of Trace-Based Split Array Caches for Embedded Applications
—Since many embedded systems execute a predefined set of programs, tuning system components to application programs and data is the approach chosen by many design techniques to o...
Alice M. Tokarnia, Marina Tachibana
ML
2006
ACM
113views Machine Learning» more  ML 2006»
13 years 9 months ago
Learning to bid in bridge
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
Asaf Amit, Shaul Markovitch
TCS
2002
13 years 8 months ago
Set-sharing is redundant for pair-sharing
Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes set-sharing. In th...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella