1991 search results - page 136 / 399 » Small Models of Large Machines |
110
click to vote
ISMB
1998
15 years 6 months ago
1998
Wedescribe a prototype system (Poly-X) for assisting an expert user in modelingprotein repeats. Poly-X reduces the large numberof degrees of freedomrequired to specify a protein m...
154
click to vote
JMLR
2006
15 years 5 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
133
click to vote
SC
2009
ACM
16 years 5 days ago
2009
ACM
Bioinformatics researchers need efficient means to process large collections of sequence data. One application of interest, genome assembly, has great potential for parallelizati...
164
click to vote
CASES
2003
ACM
15 years 10 months ago
2003
ACM
Recent research in sensor networks has raised issues of security for small embedded devices. Security concerns are motivated by the deployment of a large number of sensory devices...
136
click to vote
COLT
2001
Springer
15 years 10 months ago
2001
Springer
The notion of embedding a class of dichotomies in a class of linear half spaces is central to the support vector machines paradigm. We examine the question of determining the mini...