Sciweavers

1675 search results - page 97 / 335
» Implementing Data Cubes Efficiently
Sort
View
IFIP
2004
Springer
14 years 3 months ago
Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...
Paola Flocchini, Antonio Mesa Enriques, Linda Pagl...
IPPS
1998
IEEE
14 years 2 months ago
An Efficient Counting Network
Counting networks were introduced as a new class of concurrent, distributed, low contention data structures suitable for implementing shared counters. Their structure is similar t...
Costas Busch, Marios Mavronicolas
ADBIS
2009
Springer
162views Database» more  ADBIS 2009»
14 years 2 months ago
Efficient Set Similarity Joins Using Min-prefixes
Identification of all objects in a dataset whose similarity is not less than a specified threshold is of major importance for management, search, and analysis of data. Set similari...
Leonardo Ribeiro, Theo Härder
DAC
2010
ACM
14 years 1 months ago
Efficient fault simulation on many-core processors
Fault simulation is essential in test generation, design for test and reliability assessment of integrated circuits. Reliability analysis and the simulation of self-test structure...
Michael A. Kochte, Marcel Schaal, Hans-Joachim Wun...
LREC
2010
154views Education» more  LREC 2010»
13 years 11 months ago
CCASH: A Web Application Framework for Efficient, Distributed Language Resource Development
We introduce CCASH (Cost-Conscious Annotation Supervised by Humans), an extensible web application framework for cost-efficient annotation. CCASH provides a framework in which cos...
Paul Felt, Owen Merkling, Marc Carmen, Eric K. Rin...