Sciweavers

1232 search results - page 53 / 247
» Digraphs: theory, algorithms and applications
Sort
View
ESWA
2008
119views more  ESWA 2008»
15 years 6 months ago
Incremental clustering of mixed data based on distance hierarchy
Clustering is an important function in data mining. Its typical application includes the analysis of consumer's materials. Adaptive resonance theory network (ART) is very pop...
Chung-Chian Hsu, Yan-Ping Huang
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 10 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
BMCBI
2010
151views more  BMCBI 2010»
15 years 6 months ago
Misty Mountain clustering: application to fast unsupervised flow cytometry gating
Background: There are many important clustering questions in computational biology for which no satisfactory method exists. Automated clustering algorithms, when applied to large,...
István P. Sugár, Stuart C. Sealfon
ATAL
2011
Springer
14 years 6 months ago
Solving Stackelberg games with uncertain observability
Recent applications of game theory in security domains use algorithms to solve a Stackelberg model, in which one player (the leader) first commits to a mixed strategy and then th...
Dmytro Korzhyk, Vincent Conitzer, Ronald Parr
ITICSE
2006
ACM
16 years 2 days ago
Fast application development to demonstrate computer graphics concepts
Computer graphics concepts have a high visual component. For that reason, teaching this subject should be enriched with the use of small applications showing concepts like near an...
Pedro Pablo Gómez-Martín, Marco Anto...