Sciweavers

158 search results - page 20 / 32
» Community Learning by Graph Approximation
Sort
View
INFOCOM
2010
IEEE
13 years 6 months ago
Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing
—Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-to-end connectivity is intermittent. In these networks, forwarding decisions are generall...
Theus Hossmann, Thrasyvoulos Spyropoulos, Franck L...
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
14 years 8 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
ECCV
2006
Springer
14 years 9 months ago
Efficient Belief Propagation with Learned Higher-Order Markov Random Fields
Belief propagation (BP) has become widely used for low-level vision problems and various inference techniques have been proposed for loopy graphs. These methods typically rely on a...
Xiangyang Lan, Stefan Roth, Daniel P. Huttenlocher...
PREMI
2005
Springer
14 years 1 months ago
Geometric Decision Rules for Instance-Based Learning Problems
In the typical nonparametric approach to classification in instance-based learning and data mining, random data (the training set of patterns) are collected and used to design a d...
Binay K. Bhattacharya, Kaustav Mukherjee, Godfried...
IJCNN
2000
IEEE
14 years 19 hour ago
Piecewise Linear Homeomorphisms: The Scalar Case
The class of piecewise linear homeomorphisms (PLH) provides a convenient functional representation for many applications wherein an approximation to data is required that is inver...
Richard E. Groff, Daniel E. Koditschek, Pramod P. ...