Sciweavers

1236 search results - page 111 / 248
» fast 2010
Sort
View
TCOS
2010
15 years 2 months ago
Approximate Shortest Path Queries Using Voronoi Duals
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...
Shinichi Honiden, Michael E. Houle, Christian Somm...
DEBU
2010
128views more  DEBU 2010»
15 years 1 months ago
Designing Database Operators for Flash-enabled Memory Hierarchies
Flash memory affects not only storage options but also query processing. In this paper, we analyze the use of flash memory for database query processing, including algorithms that...
Goetz Graefe, Stavros Harizopoulos, Harumi A. Kuno...
INFORMATICALT
2010
145views more  INFORMATICALT 2010»
15 years 1 months ago
GSM Speech Coder Indirect Identification Algorithm
This paper presents GSM speech coder indirect identification algorithm based on sending novel identification pilot signals through the GSM speech channel. Each GSM subsystem distur...
Rajko Svecko, Bojan Kotnik, Amor Chowdhury, Zdenko...
PPOPP
2010
ACM
16 years 1 months ago
A practical concurrent binary search tree
We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based on optimistic techniques adapted from software transact...
Nathan Grasso Bronson, Jared Casper, Hassan Chafi,...
156
Voted
CVPR
2010
IEEE
15 years 12 months ago
SPEC Hashing: Similarity Preserving algorithm for Entropy-based Coding
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
Ruei-Sung Lin, David Ross, Jay Yagnik