5153 search results - page 481 / 1031 » Introduction to Randomized Algorithms |
168
Voted
STOC
2009
ACM
16 years 7 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...
165
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...
166
click to vote
PLDI
2006
ACM
16 years 11 days ago
2006
ACM
Applications written in unsafe languages like C and C++ are vulnerable to memory errors such as buffer overflows, dangling pointers, and reads of uninitialized data. Such errors ...
162
click to vote
NOSSDAV
2004
Springer
15 years 11 months ago
2004
Springer
Despite many years of research, fair queuing still faces a number of implementation challenges in high speed routers. In particular, in spite of proposals such as DiffServ, the st...
183
click to vote
COMPGEOM
1994
ACM
15 years 10 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...