Sciweavers

6437 search results - page 1129 / 1288
» Parallel Algorithms for Arrangements
Sort
View
130
Voted
SSDBM
1999
IEEE
118views Database» more  SSDBM 1999»
15 years 5 months ago
Evaluation of Ad Hoc OLAP: In-Place Computation
Large scale data analysis and mining activities, such as identifying interesting trends, making unusual patterns to stand out and verifying hypotheses, require sophisticated infor...
Damianos Chatziantoniou
153
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
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
15 years 4 months ago
Crossover: the divine afflatus in search
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
David Iclanzan
114
Voted
DAGSTUHL
2007
15 years 2 months ago
Multi-Aspect Tagging for Collaborative Structuring
Local tag structures have become frequent through Web 2.0: Users "tag" their data without specifying the underlying semantics. Every user annotates items in an individual...
Katharina Morik, Michael Wurst
PDCN
2007
15 years 2 months ago
Modified collision packet classification using counting bloom filter in tuple space
Packet classification continues to be an important challenge in network processing. It requires matching each packet against a database of rules and forwarding the packet accordi...
Mahmood Ahmadi, Stephan Wong
« Prev « First page 1129 / 1288 Last » Next »