Sciweavers

2157 search results - page 130 / 432
» Optimal Fast Hashing
Sort
View
TWC
2008
122views more  TWC 2008»
15 years 4 months ago
TSVC: timed efficient and secure vehicular communications with privacy preserving
In this paper, we propose a Timed Efficient and Secure Vehicular Communication (TSVC) scheme with privacy preservation, which aims at minimizing the packet overhead in terms of sig...
Xiaodong Lin, Xiaoting Sun, Xiaoyu Wang, Chenxi Zh...
137
Voted
PAMI
2010
164views more  PAMI 2010»
15 years 3 months ago
Large-Scale Discovery of Spatially Related Images
— We propose a randomized data mining method that finds clusters of spatially overlapping images. The core of the method relies on the min-Hash algorithm for fast detection of p...
Ondrej Chum, Jiri Matas
178
Voted
SDM
2012
SIAM
224views Data Mining» more  SDM 2012»
13 years 7 months ago
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
Parikshit Ram, Dongryeol Lee, Alexander G. Gray

Book
688views
17 years 2 months ago
Database Management Systems
A set of presentations covering the book, which includes the following topics ER Model and Conceptual Design, The Relational Model and SQL DDL, Relational Algebra, SQL, Database Ap...
Raghu Ramakrishnan, Johannes Gehrke
151
Voted
HPCA
2004
IEEE
16 years 5 months ago
Creating Converged Trace Schedules Using String Matching
This paper focuses on generating efficient software pipelined schedules for in-order machines, which we call Converged Trace Schedules. For a candidate loop, we form a string of t...
Satish Narayanasamy, Yuanfang Hu, Suleyman Sair, B...