5138 search results - page 434 / 1028 » Randomized Algorithms for 3-SAT |
290
click to vote
FOCS
1993
IEEE
15 years 11 months ago
1993
IEEE
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...
200
click to vote
WCNC
2010
IEEE
15 years 10 months ago
2010
IEEE
—In this paper, we study node connectivity in multi-hop wireless networks. Nodal degree of connectivity as one of the fundamental graph properties is the basis for the study of n...
171
click to vote
FGR
2004
IEEE
15 years 10 months ago
2004
IEEE
In the recent years particle filtering has been the dominant paradigm for tracking facial and body features, recognizing temporal events and reasoning in uncertainty. A major prob...
161
click to vote
FLAIRS
2008
15 years 9 months ago
2008
In this paper, we present methods to analyze dialog coherence that help us to automatically distinguish between coherent and incoherent conversations. We build a machine learning ...
178
click to vote
CCGRID
2010
IEEE
15 years 8 months ago
2010
IEEE
Abstract--Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorit...