Sciweavers

3210 search results - page 622 / 642
» Secure Similarity Search
Sort
View
ITSL
2008
15 years 1 months ago
An Empirical Comparison of NML Clustering Algorithms
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...
Petri Kontkanen, Petri Myllymäki
ISCAPDCS
2007
15 years 1 months ago
Architectural requirements of parallel computational biology applications with explicit instruction level parallelism
—The tremendous growth in the information culture, efficient digital searches are needed to extract and identify information from huge data. The notion that evolution in silicon ...
Naeem Zafar Azeemi
SBBD
2008
256views Database» more  SBBD 2008»
15 years 1 months ago
Indexing Internal Memory with Minimal Perfect Hash Functions
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
Fabiano C. Botelho, Hendrickson R. Langbehn, Guilh...
DAGSTUHL
2006
15 years 1 months ago
A Cross-Language Approach to Historic Document Retrieval
Our cultural heritage, as preserved in libraries, archives and museums, is made up of documents written many centuries ago. Largescale digitization initiatives make these documents...
Jaap Kamps, Marijn Koolen, Frans Adriaans, Maarten...
DAGSTUHL
2006
15 years 1 months ago
Efficient Software Model Checking of Data Structure Properties
This paper presents novel language and analysis techniques that significantly speed up software model checking of data structure properties. Consider checking a red-black tree imp...
Chandrasekhar Boyapati, Paul T. Darga