Sciweavers

3341 search results - page 41 / 669
» Managing a Large
Sort
View
ACSC
2003
IEEE
15 years 5 months ago
Efficient Trie-Based Sorting of Large Sets of Strings
Sorting is a fundamental algorithmic task. Many generalpurpose sorting algorithms have been developed, but efficiency gains can be achieved by designing algorithms for specific ki...
Ranjan Sinha, Justin Zobel
CORR
2000
Springer
79views Education» more  CORR 2000»
15 years 1 months ago
Many uses, many annotations for large speech corpora: Switchboard and TDT as case studies
This paper discusses the challenges that arise when large speech corpora receive an ever-broadening range of diverse and distinct annotations. Two case studies of this process are...
David Graff, Steven Bird
KDD
2009
ACM
198views Data Mining» more  KDD 2009»
16 years 1 months ago
Pervasive parallelism in data mining: dataflow solution to co-clustering large and sparse Netflix data
All Netflix Prize algorithms proposed so far are prohibitively costly for large-scale production systems. In this paper, we describe an efficient dataflow implementation of a coll...
Srivatsava Daruru, Nena M. Marin, Matt Walker, Joy...
DAC
1998
ACM
16 years 2 months ago
Efficient Coloring of a Large Spectrum of Graphs
We have developed a new algorithm and software for graph coloring by systematically combining several algorithm and software development ideas that had crucial impact on the algor...
Darko Kirovski, Miodrag Potkonjak
ISW
2009
Springer
15 years 7 months ago
Peer-to-Peer Architecture for Collaborative Intrusion and Malware Detection on a Large Scale
Abstract. The complexity of modern network architectures and the epidemic diffusion of malware require collaborative approaches for defense. We present a novel distributed system ...
Mirco Marchetti, Michele Messori, Michele Colajann...