Sciweavers

1675 search results - page 52 / 335
» Implementing Data Cubes Efficiently
Sort
View
GROUP
2010
ACM
13 years 8 months ago
Design, implementation, and evaluation of an approach for determining when programmers are having difficulty
Previous research has motivated the idea of automatically determining when programmers are having difficulty, provided an initial algorithm (unimplemented in an actual system), an...
Jason Carter, Prasun Dewan
ACSC
2003
IEEE
14 years 1 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
ACCV
2010
Springer
13 years 5 months ago
An Efficient RANSAC for 3D Object Recognition in Noisy and Occluded Scenes
In this paper, we present an efficient algorithm for 3D object recognition in presence of clutter and occlusions in noisy, sparse and unsegmented range data. The method uses a robu...
Chavdar Papazov, Darius Burschka
RTCSA
2000
IEEE
14 years 1 months ago
Space efficient wait-free buffer sharing in multiprocessor real-time systems based on timing information
A space efficient wait-free algorithm for implementing a shared buffer for real-time multiprocessor systems is presented in this paper. The commonly used method to implement share...
Håkan Sundell, Philippas Tsigas
ICDE
2001
IEEE
104views Database» more  ICDE 2001»
14 years 11 months ago
Efficient Bulk Deletes in Relational Databases
Many applications require that large amounts of data are deleted from the database ? typically, such bulk deletes are carried out periodically and involve old or out-of-date data....
Andreas Gärtner, Alfons Kemper, Donald Kossma...