Sciweavers

1227 search results - page 179 / 246
» Approximate Kernel Clustering
Sort
View
IPPS
2007
IEEE
15 years 4 months ago
Green Supercomputing in a Desktop Box
The advent of the Beowulf cluster in 1994 provided dedicated compute cycles, i.e., supercomputing for the masses, as a cost-effective alternative to large supercomputers, i.e., su...
Wu-chun Feng, Avery Ching, Chung-Hsing Hsu
ICRA
2005
IEEE
111views Robotics» more  ICRA 2005»
15 years 3 months ago
Game Theoretic Control for Robot Teams
— In the real world, noisy sensors and limited communication make it difficult for robot teams to coordinate in tightly coupled tasks. Team members cannot simply apply single-ro...
Rosemary Emery-Montemerlo, Geoffrey J. Gordon, Jef...
JUCS
2002
131views more  JUCS 2002»
14 years 9 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
ISAAC
2010
Springer
226views Algorithms» more  ISAAC 2010»
14 years 7 months ago
On Tractable Cases of Target Set Selection
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
André Nichterlein, Rolf Niedermeier, Johann...
ICONIP
2009
14 years 7 months ago
Text Mining with an Augmented Version of the Bisecting K-Means Algorithm
There is an ever increasing number of electronic documents available today and the task of organizing and categorizing this ever growing corpus of electronic documents has become t...
Yutaro Hatagami, Toshihiko Matsuka