Sciweavers

4155 search results - page 472 / 831
» Topic-Specific Optimization and Structuring
Sort
View
STOC
2003
ACM
178views Algorithms» more  STOC 2003»
16 years 7 months ago
Uniform hashing in constant time and linear space
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
Anna Östlin, Rasmus Pagh
SIGMOD
2002
ACM
135views Database» more  SIGMOD 2002»
16 years 7 months ago
StatiX: making XML count
The availability of summary data for XML documents has many applications, from providing users with quick feedback about their queries, to cost-based storage design and query opti...
Juliana Freire, Jayant R. Haritsa, Maya Ramanath, ...
EUROSYS
2007
ACM
16 years 3 months ago
STMBench7: a benchmark for software transactional memory
Software transactional memory (STM) is a promising technique for controlling concurrency in modern multi-processor architectures. STM aims to be more scalable than explicit coarse...
Rachid Guerraoui, Michal Kapalka, Jan Vitek
CEC
2009
IEEE
16 years 1 months ago
Evolving modular neural-networks through exaptation
— Despite their success as optimization methods, evolutionary algorithms face many difficulties to design artifacts with complex structures. According to paleontologists, living...
Jean-Baptiste Mouret, Stéphane Doncieux
CIKM
2009
Springer
16 years 1 months ago
Workload-aware trie indices for XML
Well-designed indices can dramatically improve query performance. Including query workload information can produce indices that yield better overall throughput while balancing the...
Yuqing Wu, Sofia Brenes, Hyungdae Yi