5115 search results - page 133 / 1023 » On Randomized Lanczos Algorithms |
171
click to vote
MM
2006
ACM
16 years 9 days ago
2006
ACM
Image annotation plays an important role in image retrieval and management. However, the results of the state-of-the-art image annotation methods are often unsatisfactory. Therefo...
168
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
We investigate the complexity of the outer face in arrangements of line segments of a fixed length in the plane, drawn uniformly at random within a square. We derive upper bounds ...
140
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
For the random 2-SAT formula F(n, p), let FC(n, p) be the formula left after the pure literal algorithm applied to F(n, p) stops. Using the recently developed Poisson cloning model...
142
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
160
click to vote
TMC
2010
15 years 4 months ago
2010
—Compromised-node and denial-of-service are two key attacks in wireless sensor networks (WSNs). In this paper, we study routing mechanisms that circumvent (bypass) black holes fo...