Sciweavers

3210 search results - page 529 / 642
» Secure Similarity Search
Sort
View
CEC
2008
IEEE
15 years 7 months ago
Directed trees: A powerful representation for sorting and ordering problems
We present a simple framework for dealing with search spaces consisting of permutations. To demonstrate its usefulness, we build upon it a simple (1 + 1)-evolutionary algorithm fo...
Benjamin Doerr, Edda Happ
ASPDAC
2005
ACM
99views Hardware» more  ASPDAC 2005»
15 years 7 months ago
A fast counterexample minimization approach with refutation analysis and incremental SAT
- It is a hotly research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. BFL algorithm is the most effective Counterexample minim...
ShengYu Shen, Ying Qin, Sikun Li
ASSETS
2005
ACM
15 years 7 months ago
SmartColor: disambiguation framework for the colorblind
Failure in visual communication between the author and the colorblind reader is caused when color effects that the author expects for the reader to experience are not observed by...
Ken Wakita, Kenta Shimamura
CIKM
2005
Springer
15 years 7 months ago
Handling frequent updates of moving objects
A critical issue in moving object databases is to develop appropriate indexing structures for continuously moving object locations so that queries can still be performed efficien...
Bin Lin, Jianwen Su
DMSN
2005
ACM
15 years 7 months ago
The threshold join algorithm for top-k queries in distributed sensor networks
In this paper we present the Threshold Join Algorithm (TJA), which is an efficient TOP-k query processing algorithm for distributed sensor networks. The objective of a top-k query...
Demetrios Zeinalipour-Yazti, Zografoula Vagena, Di...