2969 search results - page 248 / 594 » A space efficient algorithm for group structure computation |
139
click to vote
BMCBI
2004
15 years 4 months ago
2004
Background: Grouping proteins into sequence-based clusters is a fundamental step in many bioinformatic analyses (e.g., homology-based prediction of structure or function). Standar...
233
click to vote
POPL
2008
ACM
16 years 4 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
108
click to vote
FASE
2010
Springer
15 years 7 months ago
2010
Springer
Runtime assertion checking is useful for debugging programs and specifications. Existing tools check invariants as well as method preand postconditions, but mostly ignore assignabl...
120
click to vote
DAC
2005
ACM
16 years 5 months ago
2005
ACM
We present an efficient search strategy for satisfiability checking on circuits represented at the register-transfer-level (RTL). We use the RTL circuit structure by extending con...
243
click to vote
POPL
2006
ACM
16 years 4 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...