Sciweavers

1888 search results - page 335 / 378
» Proof theory and computational analysis
Sort
View
APPROX
2004
Springer
135views Algorithms» more  APPROX 2004»
14 years 1 months ago
The Diameter of Randomly Perturbed Digraphs and Some Applications.
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
Abraham Flaxman, Alan M. Frieze
PODS
2010
ACM
306views Database» more  PODS 2010»
14 years 1 months ago
Optimizing linear counting queries under differential privacy
Differential privacy is a robust privacy standard that has been successfully applied to a range of data analysis tasks. But despite much recent work, optimal strategies for answe...
Chao Li, Michael Hay, Vibhor Rastogi, Gerome Mikla...
ICSE
2001
IEEE-ACM
14 years 28 days ago
Using Transformation Systems for Software Maintenance and Reengineering
Software maintenance costs dominate software engineering costs, partly because most such engineering is done manually. Program Transformation tools leverage an engineer-provided b...
Ira D. Baxter
CIVR
2008
Springer
125views Image Analysis» more  CIVR 2008»
13 years 10 months ago
Leveraging user query log: toward improving image data clustering
Image clustering is useful in many retrieval and classification applications. The main goal of image clustering is to partition a given dataset into salient clusters such that the...
Hao Cheng, Kien A. Hua, Khanh Vu
COLT
2010
Springer
13 years 6 months ago
Toward Learning Gaussian Mixtures with Arbitrary Separation
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...
Mikhail Belkin, Kaushik Sinha