13603 search results - page 282 / 2721 » On the Complexity of Computing Treelength |
187
click to vote
RECOMB
2007
Springer
16 years 6 months ago
2007
Springer
Association, or LD (linkage disequilibrium), mapping is an intensely-studied approach to gene mapping (genome-wide or in candidate regions) that is widely hoped to be able to effic...
180
click to vote
ICS
2009
Tsinghua U.
16 years 25 days ago
2009
Tsinghua U.
“Is transactional memory useful?” is the question that cannot be answered until we provide substantial applications that can evaluate its capabilities. While existing TM appli...
174
click to vote
MM
2006
ACM
16 years 19 hour ago
2006
ACM
We create interactive art that can be enjoyed by groups such as audiences at public events with the intent to encourage communication with those around us as we play with the art....
164
click to vote
SMA
2005
ACM
15 years 11 months ago
2005
ACM
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...
155
click to vote
BIRTHDAY
2003
Springer
15 years 11 months ago
2003
Springer
The pagination problem of complex documents is in placing text and floating objects on pages in such a way that each object appears close to, but not before, its text reference. ...