Sciweavers

4536 search results - page 95 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
ICML
2000
IEEE
14 years 10 months ago
A Dynamic Adaptation of AD-trees for Efficient Machine Learning on Large Data Sets
This paper has no novel learning or statistics: it is concerned with making a wide class of preexisting statistics and learning algorithms computationally tractable when faced wit...
Paul Komarek, Andrew W. Moore
ICPP
2009
IEEE
13 years 6 months ago
Employing Transactional Memory and Helper Threads to Speedup Dijkstra's Algorithm
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...
Konstantinos Nikas, Nikos Anastopoulos, Georgios I...
PODS
2006
ACM
122views Database» more  PODS 2006»
14 years 9 months ago
Space- and time-efficient deterministic algorithms for biased quantiles over data streams
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...
COMCOM
2010
246views more  COMCOM 2010»
13 years 7 months ago
Tabu search algorithm for RP selection in PIM-SM multicast routing
: - To construct a multicast tree is the basis of multicast data transmission. The prime problem concerning the construction of a shared multicast tree is to determine the position...
Hua Wang, Xiangxu Meng, Min Zhang, Yanlong Li
MICCAI
2003
Springer
14 years 10 months ago
Relative Performance of Geometric Search Algorithms for Interpolating Unstructured Mesh Data
Abstract. Interpolation of field data from unstructured meshes requires the potentially expensive identification of the finite element or volume within which the interpolating poin...
Mahdieh Khoshniat, Gordan R. Stuhne, David A. Stei...