Sciweavers

20673 search results - page 3787 / 4135
» Improving Performance on the Internet
Sort
View
PPOPP
2010
ACM
16 years 4 months ago
Using data structure knowledge for efficient lock generation and strong atomicity
To achieve high-performance on multicore systems, sharedmemory parallel languages must efficiently implement atomic operations. The commonly used and studied paradigms for atomici...
Gautam Upadhyaya, Samuel P. Midkiff, Vijay S. Pai
PPOPP
2010
ACM
16 years 4 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
16 years 4 months ago
Optimal Distance Bounds on Time-Series Data.
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
Michail Vlachos, Philip S. Yu, Suleyman S. Kozat
ECIR
2009
Springer
16 years 4 months ago
Word Particles Applied to Information Retrieval
Document retrieval systems conventionally use words as the basic unit of representation, a natural choice since words are primary carriers of semantic information. In this paper w...
Evandro B. Gouvêa, Bhiksha Raj
ECIR
2009
Springer
16 years 4 months ago
Mean-Variance Analysis: A New Document Ranking Theory in Information Retrieval
Abstract. This paper concerns document ranking in information retrieval. In information retrieval systems, the widely accepted probability ranking principle (PRP) suggests that, fo...
Jun Wang
« Prev « First page 3787 / 4135 Last » Next »