Sciweavers

2040 search results - page 198 / 408
» Approximate Expectation Maximization
Sort
View
SDM
2011
SIAM
284views Data Mining» more  SDM 2011»
14 years 9 months ago
The Network Completion Problem: Inferring Missing Nodes and Edges in Networks
While the social and information networks have become ubiquitous, the challenge of collecting complete network data still persists. Many times the collected network data is incomp...
Myunghwan Kim 0002, Jure Leskovec
PODS
2008
ACM
221views Database» more  PODS 2008»
16 years 6 months ago
A generic flow algorithm for shared filter ordering problems
We consider a fundamental flow maximization problem that arises during the evaluation of multiple overlapping queries defined on a data stream, in a heterogenous parallel environm...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
WDAG
2009
Springer
147views Algorithms» more  WDAG 2009»
16 years 1 months ago
Compact Routing in Power-Law Graphs
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
Wei Chen, Christian Sommer 0002, Shang-Hua Teng, Y...
COCOON
2005
Springer
16 years 4 hour ago
Server Allocation Algorithms for Tiered Systems
Many web-based systems have a tiered application architecture, in which a request needs to transverse all the tiers before finishing its processing. One of the most important QoS...
Kamalika Chaudhuri, Anshul Kothari, Rudi Pendaving...
COR
2008
122views more  COR 2008»
15 years 6 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr