Sciweavers

2878 search results - page 239 / 576
» Learning the Common Structure of Data
Sort
View
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
16 years 5 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
PDP
2009
IEEE
15 years 12 months ago
Task-Parallel versus Data-Parallel Library-Based Programming in Multicore Systems
—Multicore machines are becoming common. There are many languages, language extensions and libraries devoted to improve the programmability and performance of these machines. In ...
Diego Andrade, Basilio B. Fraguela, James C. Brodm...
148
Voted
VISUALIZATION
2000
IEEE
15 years 9 months ago
Visualizing volume data using physical models
Visualization techniques enable scientists to interactively explore 3D data sets, segmenting and cutting them to reveal inner structure. While powerful, these techniques suffer fr...
David R. Nadeau, Michael J. Bailey
ATVA
2008
Springer
143views Hardware» more  ATVA 2008»
15 years 7 months ago
Automating Algebraic Specifications of Non-freely Generated Data Types
Abstract. Non-freely generated data types are widely used in case studies carried out in the theorem prover KIV. The most common examples are stores, sets and arrays. We present an...
Andriy Dunets, Gerhard Schellhorn, Wolfgang Reif
ICISC
2009
146views Cryptology» more  ICISC 2009»
15 years 2 months ago
First CPIR Protocol with Data-Dependent Computation
We design a new (n, 1)-CPIR protocol BddCpir for -bit strings as a combination of a noncryptographic (BDD-based) data structure and a more basic cryptographic primitive (communicat...
Helger Lipmaa