1135 search results - page 22 / 227 » Interactive Problem Solving via Algorithm Visualization |
161
click to vote
DATAMINE
1999
15 years 1 months ago
1999
Abstract. We describe a scalable parallel implementation of the self organizing map (SOM) suitable for datamining applications involving clustering or segmentation against large da...
109
Voted
SIGKDD
2002
15 years 1 months ago
2002
The primary aim of most data mining algorithms is to facilitate the discovery of concise and interpretable information from large amounts of data. However, many of the current for...
112
click to vote
C5
2006
IEEE
15 years 8 months ago
2006
IEEE
We present a framework that we are developing to better solve several critical issues that arise when interactive systems are extended to large displays. These issues include slow...
119
click to vote
SSS
2009
Springer
15 years 8 months ago
2009
Springer
We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximati...
112
click to vote
CIBCB
2005
IEEE
15 years 7 months ago
2005
IEEE
— Hannenhalli and Pevzner developed the first polynomial-time algorithm for the combinatorial problem of sorting of signed genomic data. Their algorithm solves the minimum numbe...