Sciweavers

986 search results - page 96 / 198
» Efficient Processing of the Cube Operator
Sort
View
SPAA
2010
ACM
14 years 10 months ago
A universal construction for wait-free transaction friendly data structures
Given the sequential implementation of any data structure, we show how to obtain an efficient, wait-free implementation of that data structure shared by any fixed number of proces...
Phong Chuong, Faith Ellen, Vijaya Ramachandran
ICIAP
2009
ACM
14 years 7 months ago
Tree Covering within a Graph Kernel Framework for Shape Classification
Abstract. Shape classification using graphs and skeletons usually involves edition processes in order to reduce the influence of structural noise. However, edition distances can no...
François-Xavier Dupé, Luc Brun
ICASSP
2011
IEEE
14 years 1 months ago
A low-power implantable neuroprocessor on nano-FPGA for Brain Machine interface applications
This paper presents the implementation of a low-power and implantable neuroprocessor on low-cost nano-FPGA for data reduction and on-the-fly spike sorting in Brain Machine Interfa...
Fei Zhang, Mehdi Aghagolzadeh, Karim G. Oweiss
ICDE
2003
IEEE
114views Database» more  ICDE 2003»
15 years 11 months ago
Designing a Super-Peer Network
A super-peer is a node in a peer-to-peer network that operates both as a server to a set of clients, and as an equal in a network of super-peers. Super-peer networks strike a bala...
Beverly Yang, Hector Garcia-Molina
ICDE
1998
IEEE
163views Database» more  ICDE 1998»
15 years 11 months ago
Fast Nearest Neighbor Search in High-Dimensional Space
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query process...
Stefan Berchtold, Bernhard Ertl, Daniel A. Keim, H...