1331 search results - page 191 / 267 » Complexity bounds for zero-test algorithms |
161
click to vote
WAW
2004
Springer
15 years 8 months ago
2004
Springer
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
139
click to vote
WWW
2009
ACM
16 years 3 months ago
2009
ACM
Motivated by the emergence of auction-based marketplaces for display ads such as the Right Media Exchange, we study the design of a bidding agent that implements a display adverti...
144
click to vote
SOFSEM
2000
Springer
15 years 6 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
115
click to vote
CC
2007
Springer
15 years 3 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
220
click to vote
ICDE
2005
IEEE
16 years 4 months ago
2005
IEEE
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...