3172 search results - page 511 / 635 » On the Random-Self-Reducibility of Complete Sets |
170
click to vote
ENDM
2008
15 years 6 months ago
2008
A graph G is clique-perfect if the cardinality of a maximum clique-independent set of H equals the cardinality of a minimum clique-transversal of H, for every induced subgraph H o...
184
click to vote
IAJIT
2008
15 years 6 months ago
2008
: The fuzzy c-means clustering algorithm has been widely used to obtain the fuzzy k-partitions. This algorithm requires that the user gives the number of clusters k. To find automa...
208
click to vote
CG
2006
Springer
15 years 6 months ago
2006
Springer
s: clustering, denoising, sharp feature, shape abstraction, reverse engineering In this paper we describe a hierarchical face clustering algorithm for triangle meshes based on fit...
268
click to vote
IR
2008
15 years 6 months ago
2008
We consider the following autocompletion search scenario: imagine a user of a search engine typing a query; then with every keystroke display those completions of the last query wo...
155
click to vote
IJON
2006
15 years 6 months ago
2006
Sensory systems often use groups of redundant neurons to represent stimulus information both during transduction and population coding of features. This redundancy makes the syste...