Sciweavers

420 search results - page 70 / 84
» Generating random regular graphs
Sort
View
ESA
2011
Springer
251views Algorithms» more  ESA 2011»
12 years 7 months ago
Improved Approximation Algorithms for Bipartite Correlation Clustering
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke...
ICCV
2005
IEEE
14 years 9 months ago
Incorporating Visual Knowledge Representation in Stereo Reconstruction
In this paper, we present a two-layer generative model that incorporates generic middle-level visual knowledge for dense stereo reconstruction. The visual knowledge is represented...
Adrian Barbu, Song Chun Zhu
ADHOCNOW
2004
Springer
14 years 1 months ago
Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
Errol L. Lloyd, Rui Liu, S. S. Ravi
CIC
2006
101views Communications» more  CIC 2006»
13 years 9 months ago
Non Blocking OVSF Codes Influence The Performance Of WCDMA System
In this paper the performance of OVSF and NOVSF codes in WCDMA are evaluated by calculating their blocking probability and plotting graphs between blocking probability and new call...
Shailendra Mishra, Nipur
SIAMJO
2002
142views more  SIAMJO 2002»
13 years 7 months ago
A Complementary Pivoting Approach to the Maximum Weight Clique Problem
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
Alessio Massaro, Marcello Pelillo, Immanuel M. Bom...