1048 search results - page 180 / 210 » Best Probabilistic Transformers |
180
Voted
PACT
2005
Springer
15 years 10 months ago
2005
Springer
The goal of our investigation is to find automatically the best rule for a cell in the cellular automata model. The cells are either of type Obstacle, Empty or Creature. Only Crea...
139
click to vote
CRYPTO
2004
Springer
15 years 10 months ago
2004
Springer
We study both distinguishing and key-recovery attacks against E0, the keystream generator used in Bluetooth by means of correlation. First, a powerful computation method of correla...
188
Voted
SWAT
2010
Springer
15 years 10 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
172
click to vote
ASPLOS
2008
ACM
15 years 7 months ago
2008
ACM
Standard concurrency control mechanisms offer a trade-off: Transactional memory approaches maximize concurrency, but suffer high overheads and cost for retrying in the case of act...
170
Voted
BMCBI
2007
15 years 5 months ago
2007
Background: For successful protein structure prediction by comparative modeling, in addition to identifying a good template protein with known structure, obtaining an accurate seq...