Sciweavers

10289 search results - page 6 / 2058
» Standard bases in K
Sort
View
118
Voted
ICALP
2010
Springer
15 years 6 months ago
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
Venkatesan Guruswami, Rishi Saket
216
Voted
ICDE
2008
IEEE
178views Database» more  ICDE 2008»
16 years 3 months ago
On the Optimal Selection of k in the k-Anonymity Problem
When disseminating data involving human subjects, researchers have to weigh in the requirements of privacy of the individuals involved in the data. A model widely used for enhancin...
Rinku Dewri, Indrajit Ray, Indrakshi Ray, Darrell ...
FOCS
2010
IEEE
14 years 12 months ago
Stability Yields a PTAS for k-Median and k-Means Clustering
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...
Pranjal Awasthi, Avrim Blum, Or Sheffet
105
Voted
DEPCOS
2008
IEEE
96views Hardware» more  DEPCOS 2008»
15 years 8 months ago
Standards Conformity Framework in Comparison with Contemporary Methods Supporting Standards Application
Achieving and assessing conformity with standards and compliance with various sets of requirements generates significant costs for contemporary economies. Great deal of this is sp...
Lukasz Cyra, Janusz Górski
ICPR
2008
IEEE
15 years 8 months ago
On the selection of base prototypes for LAESA and TLAESA classifiers
—The k nearest neighbor (k-NN) classifier has been extensively used as a nonparametric technique in Pattern Recognition. However, in some applications where the training set is l...
Selene Hernández-Rodríguez, Jos&eacu...