2192 search results - page 246 / 439 » Algorithms for Challenging Motif Problems |
132
Voted
SIGMOD
2011
ACM
14 years 6 months ago
2011
ACM
We study the problem of context-sensitive ranking for document retrieval, where a context is defined as a sub-collection of documents, and is specified by queries provided by do...
138
click to vote
INFOCOM
2003
IEEE
15 years 9 months ago
2003
IEEE
— The problem of efficient data structures for IP lookups has been well studied in literature. Techniques such as LC tries and Extensible Hashing are commonly used. In this pape...
170
Voted
BMCBI
2011
14 years 7 months ago
2011
Background: Graphical models of network associations are useful for both visualizing and integrating multiple types of association data. Identifying modules, or groups of function...
143
click to vote
ICCAD
2009
IEEE
15 years 1 months ago
2009
IEEE
Boolean satisfiability (SAT) based methods have traditionally been popular for formally verifying properties for digital circuits. We present a novel methodology for formulating a...
137
Voted
BMCBI
2008
15 years 4 months ago
2008
Background: We propose a multiple sequence alignment (MSA) algorithm and compare the alignment-quality and execution-time of the proposed algorithm with that of existing algorithm...