Sciweavers

5595 search results - page 260 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
198
Voted
CCS
2009
ACM
16 years 7 months ago
The union-split algorithm and cluster-based anonymization of social networks
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
Brian Thompson, Danfeng Yao
ICCAD
2001
IEEE
84views Hardware» more  ICCAD 2001»
16 years 3 months ago
Minimum-Buffered Routing of Non-Critical Nets for Slew Rate and Reliability Control
In high-speed digital VLSI design, bounding the load capacitance at gate outputs is a well-known methodology to improve coupling noise immunity, reduce degradation of signal trans...
Charles J. Alpert, Andrew B. Kahng, Bao Liu, Ion I...
CIKM
2000
Springer
15 years 10 months ago
Vector Approximation based Indexing for Non-uniform High Dimensional Data Sets
With the proliferation of multimedia data, there is increasing need to support the indexing and searching of high dimensional data. Recently, a vector approximation based techniqu...
Hakan Ferhatosmanoglu, Ertem Tuncel, Divyakant Agr...
IPCO
1996
89views Optimization» more  IPCO 1996»
15 years 7 months ago
On Dependent Randomized Rounding Algorithms
In recent years, approximation algorithms based on randomized rounding of fractional optimal solutions have been applied to several classes of discrete optimization problems. In t...
Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra
145
Voted
CPM
2004
Springer
109views Combinatorics» more  CPM 2004»
15 years 12 months ago
Approximate Labelled Subtree Homeomorphism
Given two undirected trees T and P, the Subtree Homeomorphism Problem is to find whether T has a subtree t that can be transformed into P by removing entire subtrees, as well as ...
Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal ...