19700 search results - page 3778 / 3940 » DNA-Based Computation Times |
113
Voted
OSDI
2006
ACM
16 years 3 months ago
2006
ACM
Existing virtual memory systems usually work well with applications written in C and C++, but they do not provide adequate support for garbage-collected applications. The performa...
129
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...
122
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
141
Voted
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
201
click to vote
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
Entity Resolution (ER) is the problem of identifying which records in a database refer to the same real-world entity. An exhaustive ER process involves computing the similarities b...