Sciweavers

15033 search results - page 384 / 3007
» Complexity Theory and Algorithms
Sort
View
CPM
2008
Springer
112views Combinatorics» more  CPM 2008»
15 years 9 months ago
Computing Inverse ST in Linear Complexity
The Sort Transform (ST) can significantly speed up the block sorting phase of the Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best result o...
Ge Nong, Sen Zhang, Wai Hong Chan
JETAI
2007
141views more  JETAI 2007»
15 years 7 months ago
Exchange market for complex commodities: search for optimal matches
The Internet has led to the development of on-line markets, and computer scientists have designed various auction algorithms, as well as automated exchanges for standardized commo...
Eugene Fink, Jianli Gong, Josh Johnson
ICIP
2000
IEEE
16 years 9 months ago
Rate-Complexity-Distortion Optimization for Quadtree-Based DCT Coding
In this paper, we study rate-complexity-distortion (R-C-D) tradeoffs for video coding, where we focus on the complexity of computing the inverse DCT. A quadtree coding approach is...
Krisda Lengwehasatit, Antonio Ortega
STACS
2000
Springer
15 years 11 months ago
Average-Case Quantum Query Complexity
Abstract. We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be a...
Andris Ambainis, Ronald de Wolf
CVPR
2007
IEEE
16 years 9 months ago
Artificial Complex Cells via the Tropical Semiring
The seminal work of Hubel and Wiesel [14] and the vast amount of work that followed it prove that hierarchies of increasingly complex cells play a central role in cortical computa...
Lior Wolf, Moshe Guttmann