Sciweavers

11213 search results - page 2140 / 2243
» Low-contention data structures
Sort
View
COLING
2002
13 years 10 months ago
The LinGO Redwoods Treebank: Motivation and Preliminary Applications
The LinGO Redwoods initiative is a seed activity in the design and development of a new type of treebank. While several medium- to large-scale treebanks exist for English (and for...
Stephan Oepen, Kristina Toutanova, Stuart M. Shieb...
CVPR
2006
IEEE
15 years 2 days ago
Acceleration Strategies for Gaussian Mean-Shift Image Segmentation
Gaussian mean-shift (GMS) is a clustering algorithm that has been shown to produce good image segmentations (where each pixel is represented as a feature vector with spatial and r...
Miguel Á. Carreira-Perpiñán
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
14 years 10 months ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori
ISCA
2010
IEEE
336views Hardware» more  ISCA 2010»
14 years 2 months ago
Reducing cache power with low-cost, multi-bit error-correcting codes
Technology advancements have enabled the integration of large on-die embedded DRAM (eDRAM) caches. eDRAM is significantly denser than traditional SRAMs, but must be periodically r...
Chris Wilkerson, Alaa R. Alameldeen, Zeshan Chisht...
SPAA
2004
ACM
14 years 3 months ago
Cache-oblivious shortest paths in graphs using buffer heap
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
Rezaul Alam Chowdhury, Vijaya Ramachandran
« Prev « First page 2140 / 2243 Last » Next »