1187 search results - page 235 / 238 » Constructing Distributed Representations Using Additive Clus... |
92
Voted
BICOB
2009
Springer
15 years 4 months ago
2009
Springer
The de novo assembly of genomes from high-throughput short reads is an active area of research. Several promising methods have been recently developed, with applicability mainly re...
LCTRTS
2005
Springer
15 years 3 months ago
2005
Springer
Real-time garbage collection has been shown to be feasible, but for programs with high allocation rates, the utilization achievable is not sufficient for some systems. Since a hi...
106
click to vote
ICFP
2010
ACM
14 years 10 months ago
2010
ACM
Several recent security-typed programming languages, such as Aura, PCML5, and Fine, allow programmers to express and enforce access control and information flow policies. Most of ...
STOC
2002
ACM
15 years 9 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
EUROSYS
2008
ACM
15 years 6 months ago
2008
ACM
We present Flicker, an infrastructure for executing securitysensitive code in complete isolation while trusting as few as 250 lines of additional code. Flicker can also provide me...