Sciweavers

2698 search results - page 367 / 540
» Approximation Algorithms for the Weighted Independent Set Pr...
Sort
View
FOCS
2007
IEEE
16 years 24 days ago
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
Daniel Stefankovic, Santosh Vempala, Eric Vigoda
NIPS
2007
15 years 8 months ago
Convex Clustering with Exemplar-Based Models
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
Danial Lashkari, Polina Golland
INFOCOM
2009
IEEE
16 years 1 months ago
Locally vs. Globally Optimized Flow-Based Content Distribution to Mobile Nodes
—The paper deals with efficient distribution of timely information to flows of mobile devices. We consider the case where a set of Information Dissemination Devices (IDDs) broa...
Mhameed Aezladen, Reuven Cohen, Danny Raz
ICDM
2005
IEEE
146views Data Mining» more  ICDM 2005»
16 years 2 days ago
Merging Interface Schemas on the Deep Web via Clustering Aggregation
We consider the problem of integrating a large number of interface schemas over the Deep Web, The scale of the problem and the diversity of the sources present serious challenges ...
Wensheng Wu, AnHai Doan, Clement T. Yu
TMI
2008
135views more  TMI 2008»
15 years 6 months ago
A Factorization Approach for Cone-Beam Reconstruction on a Circular Short-Scan
In this paper, we introduce a new algorithm for 3-D image reconstruction from cone-beam (CB) projections acquired along a partial circular scan. Our algorithm is based on a novel, ...
Frank Dennerlein, Frédéric Noo, H. S...