5138 search results - page 302 / 1028 » Randomized Algorithms for 3-SAT |
152
click to vote
FOCS
2006
IEEE
16 years 20 days ago
2006
IEEE
We present new algebraic approaches for several wellknown combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our wo...
160
click to vote
ROBIO
2006
IEEE
16 years 18 days ago
2006
IEEE
Abstract— In this paper, we proposed a dynamic mobilityassisted MDS-based localization algorithms for sparse mobile sensor network. For sparse networks, the assumption of the exi...
173
click to vote
EUROPAR
2003
Springer
15 years 11 months ago
2003
Springer
In this paper we propose a new parallel clustering algorithm based on the incremental construction of the compact sets of a collection of objects. This parallel algorithm is portab...
149
click to vote
IMA
1995
Springer
15 years 10 months ago
1995
Springer
An algorithm for finding small-weight words in large linear codes is developed and a precise analysis of its complexity is given. It is in particular able to decode random [512,256...
179
click to vote
FCT
1991
Springer
15 years 10 months ago
1991
Springer
We report on improved practical algorithms for lattice basis reduction. We propose a practical oating point version of the L3{algorithm of Lenstra, Lenstra, Lovasz (1982). We pres...