Sciweavers

425 search results - page 6 / 85
» Polynomial Time Data Reduction for Dominating Set
Sort
View
AMSTERDAM
2009
14 years 7 months ago
Natural Color Categories Are Convex Sets
The paper presents a statistical evaluation of the typological data about color naming systems across the languages of the world that have been obtained by the World Color Survey....
Gerhard Jäger
PR
2006
87views more  PR 2006»
14 years 9 months ago
Prototype reduction schemes applicable for non-stationary data sets
All of the prototype reduction schemes (PRS) which have been reported in the literature, process time-invariant data to yield a subset of prototypes that are useful in nearest-nei...
Sang-Woon Kim, B. John Oommen
ICDT
2005
ACM
149views Database» more  ICDT 2005»
15 years 2 months ago
Approximately Dominating Representatives
We propose and investigate from the algorithmic standpoint a novel form of fuzzy query called approximately dominating representatives or ADRs. The ADRs of a multidimensional point...
Vladlen Koltun, Christos H. Papadimitriou
FOCS
2009
IEEE
15 years 4 months ago
(Meta) Kernelization
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshta...
PAMI
2006
141views more  PAMI 2006»
14 years 9 months ago
Diffusion Maps and Coarse-Graining: A Unified Framework for Dimensionality Reduction, Graph Partitioning, and Data Set Parameter
We provide evidence that non-linear dimensionality reduction, clustering and data set parameterization can be solved within one and the same framework. The main idea is to define ...
Stéphane Lafon, Ann B. Lee