1041 search results - page 188 / 209 » Randomizing Reductions of Search Problems |
125
click to vote
BMCBI
2010
14 years 12 months ago
2010
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
DKE
1998
14 years 11 months ago
1998
Disk I/O is a major bottleneck for query processing in database applications. This bottleneck is especially a problem for temporal databases because of their large size. Reduction...
198
Voted
Publication
The size of computer networks, along with their bandwidths, is growing exponentially. To support these large, high-speed networks, it is neccessary to be able to forward packets in...
WWW
2006
ACM
16 years 13 days ago
2006
ACM
Expanding a seed set into a larger community is a common procedure in link-based analysis. We show how to adapt recent results from theoretical computer science to expand a seed s...
ICS
2010
Tsinghua U.
15 years 9 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...