Sciweavers

1512 search results - page 190 / 303
» Inference Algorithms for Similarity Networks
Sort
View
ECCC
2008
108views more  ECCC 2008»
14 years 10 months ago
The Complexity of Rationalizing Matchings
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...
Shankar Kalyanaraman, Christopher Umans
CVPR
2011
IEEE
14 years 1 months ago
Connecting Non-Quadratic Variational Models and MRFs
Spatially-discrete Markov random fields (MRFs) and spatially-continuous variational approaches are ubiquitous in low-level vision, including image restoration, segmentation, opti...
Kevin Schelten, Stefan Roth
CVPR
2012
IEEE
13 years 11 days ago
Multiclass pixel labeling with non-local matching constraints
A popular approach to pixel labeling problems, such as multiclass image segmentation, is to construct a pairwise conditional Markov random field (CRF) over image pixels where the...
Stephen Gould
COMSWARE
2008
IEEE
14 years 11 months ago
Extracting dense communities from telecom call graphs
Social networks refer to structures made of nodes that represent people or other entities embedded in a social context, and whose edges represent interaction between entities. Typi...
Vinayaka Pandit, Natwar Modani, Sougata Mukherjea,...
NGC
2001
Springer
196views Communications» more  NGC 2001»
15 years 2 months ago
Application-Level Multicast Using Content-Addressable Networks
Abstract. Most currently proposed solutions to application-level multicast organize the group members into an application-level mesh over which a DistanceVector routing protocol, o...
Sylvia Ratnasamy, Mark Handley, Richard M. Karp, S...