Sciweavers

934 search results - page 99 / 187
» Quantum Algorithmic Entropy
Sort
View
WEA
2007
Springer
125views Algorithms» more  WEA 2007»
14 years 4 months ago
Simple Compression Code Supporting Random Access and Fast String Matching
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
Kimmo Fredriksson, Fedor Nikitin
AAAI
1998
13 years 11 months ago
Which Search Problems Are Random?
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
Tad Hogg
ICASSP
2011
IEEE
13 years 1 months ago
Keypoint-based near-duplicate images detection using affine invariant feature and color matching
This paper presents a new keypoint-based approach to nearduplicate images detection. It consists of three steps. Firstly, the keypoints of images are extracted and then matched. S...
Yue Wang, Zujun Hou, Karianto Leman
GLVLSI
2007
IEEE
135views VLSI» more  GLVLSI 2007»
14 years 4 months ago
Exact sat-based toffoli network synthesis
Compact realizations of reversible logic functions are of interest in the design of quantum computers. Such reversible functions are realized as a cascade of Toffoli gates. In th...
Daniel Große, Xiaobo Chen, Gerhard W. Dueck,...
IPPS
2005
IEEE
14 years 3 months ago
Desynchronized Pfair Scheduling on Multiprocessors
Pfair scheduling, currently the only known way of optimally scheduling recurrent real-time tasks on multiprocessors, imposes certain requirements that may limit its practical impl...
UmaMaheswari C. Devi, James H. Anderson