3500 search results - page 337 / 700 » Implementing Java on Clusters |
74
Voted
VLDB
1995
ACM
15 years 4 months ago
1995
ACM
In this paper, three techniques to implement logical OIDs are thoroughly evaluated: hashing, B-trees and a technique called direct mapping. Among these three techniques, direct ma...
105
Voted
ACL
2008
15 years 2 months ago
2008
This paper demonstrates a new method for leveraging unstructured annotations to infer semantic document properties. We consider the domain of product reviews, which are often anno...
101
Voted
CGF
2004
15 years 20 days ago
2004
We present a novel clustering algorithm for polygonal meshes which approximates a Centroidal Voronoi Diagram construction. The clustering provides an efficient way to construct un...
121
click to vote
CP
2010
Springer
14 years 10 months ago
2010
Springer
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
120
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
Shrinkage-based exponential language models, such as the recently introduced Model M, have provided significant gains over a range of tasks [1]. Training such models requires a l...