1622 search results - page 122 / 325 » Learning a Hidden Matching |
143
Voted
ANCS
2007
ACM
15 years 7 months ago
2007
ACM
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
141
click to vote
RECOMB
2004
Springer
16 years 3 months ago
2004
Springer
Abstract. We present an approach to inferring probabilistic models of generegulatory networks that is intended to provide a more mechanistic representation of transcriptional regul...
119
click to vote
WEBI
2009
Springer
15 years 10 months ago
2009
Springer
—The key to Deep Web crawling is to submit promising keywords to query form and retrieve Deep Web content efficiently. To select keywords, existing methods make a decision based ...
128
click to vote
SARA
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The presence of long gaps dramatically increases the difficulty of detecting and characterizing complex events hidden in long sequences. In order to cope with this proble...
122
click to vote
CP
2004
Springer
15 years 8 months ago
2004
Springer
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex combinatorial problems. However, users of constraint programming technology nee...