Sciweavers

338 search results - page 15 / 68
» Approximation Spaces and Information Granulation
Sort
View
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
13 years 5 months ago
Differentially Private Combinatorial Optimization
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
JUCS
2002
131views more  JUCS 2002»
13 years 7 months ago
Finding Median Partitions Using Information-Theoretical-Based Genetic Algorithms
: In a database with categorical attributes, each attribute defines a partition whose classes can be regarded as natural clusters of rows. In this paper we focus on finding a parti...
Dana Cristofor, Dan A. Simovici
CCA
2009
Springer
14 years 2 months ago
Computability of Homology for Compact Absolute Neighbourhood Retracts
In this note we discuss the information needed to compute the homology groups of a topological space. We argue that the natural class of spaces to consider are the compact absolut...
Pieter Collins
SIGIR
1992
ACM
13 years 11 months ago
Bead: Explorations in Information Visualization
ct We describe work on the visualization of bibliographic data and, to aid in this task, the application of numerical techniques for multidimensional scaling. Many areas of scienti...
Matthew Chalmers, Paul Chitson
COMPGEOM
2011
ACM
12 years 11 months ago
Reeb graphs: approximation and persistence
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
Tamal K. Dey, Yusu Wang