Sciweavers

1670 search results - page 322 / 334
» Fast Computation of Data Correlation Using BDDs
Sort
View
TVLSI
2010
13 years 3 months ago
C-Pack: A High-Performance Microprocessor Cache Compression Algorithm
Microprocessor designers have been torn between tight constraints on the amount of on-chip cache memory and the high latency of off-chip memory, such as dynamic random access memor...
Xi Chen, Lei Yang, Robert P. Dick, Li Shang, Haris...
ECCV
2006
Springer
14 years 10 months ago
Unsupervised Texture Segmentation with Nonparametric Neighborhood Statistics
Abstract. This paper presents a novel approach to unsupervised texture segmentation that relies on a very general nonparametric statistical model of image neighborhoods. The method...
Suyash P. Awate, Tolga Tasdizen, Ross T. Whitaker
SOFSEM
2009
Springer
14 years 5 months ago
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...
Martin Dietzfelbinger, Ulf Schellbach
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 1 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
GIS
2007
ACM
14 years 9 months ago
Location anonymity in continuous location-based services
A major concern for large-scale deployment of location-based services (LBSs) is the potential abuse of their client location data, which may imply sensitive personal information. ...
Toby Xu, Ying Cai