1670 search results - page 322 / 334 » Fast Computation of Data Correlation Using BDDs |
136
click to vote
TVLSI
2010
14 years 6 months ago
2010
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...
99
Voted
ECCV
2006
Springer
16 years 1 months ago
2006
Springer
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...
90
Voted
SOFSEM
2009
Springer
15 years 8 months ago
2009
Springer
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...
91
Voted
COCO
2003
Springer
15 years 4 months ago
2003
Springer
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...
179
Voted
GIS
2007
ACM
16 years 22 days ago
2007
ACM
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. ...