Sciweavers

133 search results - page 8 / 27
» Approximate Hypergraph Partitioning and Applications
Sort
View
JMLR
2012
11 years 10 months ago
Noise-Contrastive Estimation of Unnormalized Statistical Models, with Applications to Natural Image Statistics
We consider the task of estimating, from observed data, a probabilistic model that is parameterized by a finite number of parameters. In particular, we are considering the situat...
Michael Gutmann, Aapo Hyvärinen
INFOCOM
2000
IEEE
13 years 12 months ago
Optimal Partition of QoS requirements with Discrete Cost Functions
Abstract—The future Internet is expected to support applications with quality of service (QoS) requirements. For this end several mechanisms are suggested in the IETF to support ...
Danny Raz, Yuval Shavitt
PODS
2008
ACM
153views Database» more  PODS 2008»
14 years 7 months ago
Approximation algorithms for co-clustering
Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by severa...
Aris Anagnostopoulos, Anirban Dasgupta, Ravi Kumar
ICDM
2007
IEEE
124views Data Mining» more  ICDM 2007»
14 years 1 months ago
Community Learning by Graph Approximation
Learning communities from a graph is an important problem in many domains. Different types of communities can be generalized as link-pattern based communities. In this paper, we p...
Bo Long, Xiaoyun Xu, Zhongfei (Mark) Zhang, Philip...
HSNMC
2003
Springer
102views Multimedia» more  HSNMC 2003»
14 years 21 days ago
A RTT-based Partitioning Algorithm for a Multi-rate Reliable Multicast Protocol
Various Internet applications involve multiple parties and usually adopt a one-to-many communication paradigm (multicast). The presence of multiple receivers in a multicast session...
Moufida Maimour, CongDuc Pham