2168 search results - page 38 / 434 » Randomized Algorithms and Complexity Theory |
108
click to vote
DATE
2007
IEEE
15 years 9 months ago
2007
IEEE
In this paper we introduce a new algorithm for model order reduction in the presence of parameter or process variation. Our analysis is performed using a graph interpretation of t...
121
Voted
KELSI
2004
Springer
15 years 8 months ago
2004
Springer
Multiple sequence alignment (MSA) is a vital problem in biology. Optimal alignment of multiple sequences becomes impractical even for a modest number of sequences [1] since the gen...
126
Voted
JSAC
2007
15 years 2 months ago
2007
— In information theory, it has been shown that network coding can effectively improve the throughput of multicast communication sessions in directed acyclic graphs. More practic...
134
Voted
STOC
2009
ACM
16 years 3 months ago
2009
ACM
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
113
Voted
WDAG
2010
Springer
15 years 26 days ago
2010
Springer
Most people believe that renaming is easy: simply choose a name at random; if more than one process selects the same name, then try again. We highlight the issues that occur when t...