Sciweavers

1971 search results - page 329 / 395
» A clustering method that uses lossy aggregation of data
Sort
View
148
Voted
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 4 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
93
Voted
CCGRID
2008
IEEE
15 years 7 months ago
On the Optimization of Resource Utilization in Distributed Multimedia Applications
—The application and research area of Multimedia Content Analysis (MMCA) considers all aspects of the automated extraction of new knowledge from large multimedia data streams and...
R. Yang, Robert D. van der Mei, D. Roubos, Frank J...
LCPC
2007
Springer
15 years 6 months ago
Associative Parallel Containers in STAPL
The Standard Template Adaptive Parallel Library (stapl) is a parallel programming framework that extends C++ and stl with support for parallelism. stapl provides a collection of pa...
Gabriel Tanase, Chidambareswaran Raman, Mauro Bian...
EUPROJECTS
2006
Springer
15 years 4 months ago
Web Mediators for Accessible Browsing
We present a highly accurate method for classifying web pages based on link percentage, which is the percentage of text characters that are parts of links normalized by the number...
Benjamin N. Waber, John J. Magee, Margrit Betke
90
Voted
ISSAC
2007
Springer
107views Mathematics» more  ISSAC 2007»
15 years 6 months ago
A disk-based parallel implementation for direct condensation of large permutation modules
Through the use of a new disk-based method for enumerating very large orbits, condensation for orbits with tens of billions of elements can be performed. The algorithm is novel in...
Eric Robinson, Jürgen Müller 0004, Gene ...