4110 search results - page 662 / 822 » Efficient algorithms for the 2-gathering problem |
164
click to vote
BMCBI
2007
15 years 4 months ago
2007
Background: One of the essential processing events during pre-mRNA maturation is the posttranscriptional addition of a polyadenine [poly(A)] tail. The 3'-end poly(A) track pr...
164
click to vote
PODC
2009
ACM
16 years 5 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
152
click to vote
DAC
1994
ACM
15 years 8 months ago
1994
ACM
In current research, the minimum cycle times of finite state machines are estimated by computing the delays of the combinational logic in the finite state machines. Even though th...
125
Voted
ANCS
2006
ACM
15 years 8 months ago
2006
ACM
While the problem of high performance packet classification has received a great deal of attention in recent years, the research community has yet to develop algorithmic methods t...
152
click to vote
COMPGEOM
2001
ACM
15 years 8 months ago
2001
ACM
This presentation illustrates examples of my geometric sculpture and outlines certain design techniques. I apply methods from the field of computational geometry to the creation o...