Sciweavers

776 search results - page 9 / 156
» Distributed Information Regularization on Graphs
Sort
View
111
Voted
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
15 years 7 months ago
Effective latent space graph-based re-ranking model with global consistency
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
Hongbo Deng, Michael R. Lyu, Irwin King
COLT
2006
Springer
15 years 4 months ago
Maximum Entropy Distribution Estimation with Generalized Regularization
Abstract. We present a unified and complete account of maximum entropy distribution estimation subject to constraints represented by convex potential functions or, alternatively, b...
Miroslav Dudík, Robert E. Schapire
LICS
2005
IEEE
15 years 6 months ago
Uniform Distributed Synthesis
We provide a uniform solution to the problem of synthesizing a finite-state distributed system. An instance of the synthesis problem consists of a system architecture and a tempo...
Bernd Finkbeiner, Sven Schewe
124
Voted
ICDE
2012
IEEE
232views Database» more  ICDE 2012»
13 years 2 months ago
Horton: Online Query Execution Engine for Large Distributed Graphs
—Large graphs are used in many applications, such as social networking. The management of these graphs poses new challenges because such graphs are too large to fit on a single ...
Mohamed Sarwat, Sameh Elnikety, Yuxiong He, Gabrie...
CORR
2011
Springer
155views Education» more  CORR 2011»
14 years 7 months ago
Subexponential convergence for information aggregation on regular trees
— We consider the decentralized binary hypothesis testing problem on trees of bounded degree and increasing depth. For a regular tree of depth t and branching factor k ≥ 2, we ...
Yashodhan Kanoria, Andrea Montanari