Sciweavers

2593 search results - page 176 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
ML
2010
ACM
142views Machine Learning» more  ML 2010»
15 years 4 months ago
Fast adaptive algorithms for abrupt change detection
We propose two fast algorithms for abrupt change detection in streaming data that can operate on arbitrary unknown data distributions before and after the change. The first algor...
Daniel Nikovski, Ankur Jain
ICDM
2007
IEEE
116views Data Mining» more  ICDM 2007»
16 years 16 days ago
A Computational Approach to Style in American Poetry
We develop a quantitative method to assess the style of American poems and to visualize a collection of poems in relation to one another. Qualitative poetry criticism helped guide...
David M. Kaplan, David M. Blei
ICPP
2007
IEEE
16 years 16 days ago
Improving Search Using a Fault-Tolerant Overlay in Unstructured P2P Systems
Gnutella overlays have evolved to use a two-tier topology. However, we observed that the new topology had only achieved modest improvements in search success rates. Also, the new ...
William Acosta, Surendar Chandra
SWAT
1992
Springer
101views Algorithms» more  SWAT 1992»
15 years 10 months ago
Parallel Algorithms for Priority Queue Operations
This paper presents parallel algorithms for priority queue operations on a p-processor EREWPRAM. The algorithms are based on a new data structure, the Min-path Heap (MH), which is...
Maria Cristina Pinotti, Geppino Pucci
APGV
2010
ACM
266views Visualization» more  APGV 2010»
15 years 10 months ago
Horizon estimation: perceptual and computational experiments
The human visual system is able to quickly and robustly infer a wealth of scene information – the scene "gist" – already after 100 milliseconds of image presentation...
Christian Herdtweck, Christian Wallraven