Sciweavers

776 search results - page 6 / 156
» Distributed Information Regularization on Graphs
Sort
View
94
Voted
EJC
2011
14 years 4 months ago
Matching and edge-connectivity in regular graphs
Henning and Yeo proved a lower bound for the minimum size of a maximum matching in a connected k-regular graphs with n vertices; it is sharp infinitely often. In an earlier paper...
Suil O, Douglas B. West
SIGIR
2011
ACM
14 years 10 days ago
Learning search tasks in queries and web pages via graph regularization
As the Internet grows explosively, search engines play a more and more important role for users in effectively accessing online information. Recently, it has been recognized that ...
Ming Ji, Jun Yan, Siyu Gu, Jiawei Han, Xiaofei He,...
123
Voted
ICASSP
2011
IEEE
14 years 1 months ago
Content preference estimation in online social networks: Message passing versus sparse reconstruction on graphs
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
Jacob Chakareski
87
Voted
MFCS
2010
Springer
14 years 8 months ago
Asynchronous Omega-Regular Games with Partial Information
We address the strategy problem for ω-regular two-player games with partial information, played on finite game graphs. We consider two different kinds of observability on a gene...
Bernd Puchala
86
Voted
ACCV
2010
Springer
14 years 4 months ago
Network Connectivity via Inference over Curvature-Regularizing Line Graphs
Abstract. Diffusion Tensor Imaging (DTI) provides estimates of local directional information regarding paths of white matter tracts in the human brain. An important problem in DTI ...
Maxwell D. Collins, Vikas Singh, Andrew L. Alexand...