Sciweavers

6274 search results - page 50 / 1255
» From query complexity to computational complexity
Sort
View
CAE
2007
14 years 10 days ago
Conceptualizing Birkhoff's Aesthetic Measure Using Shannon Entropy and Kolmogorov Complexity
In 1928, George D. Birkhoff introduced the Aesthetic Measure, defined as the ratio between order and complexity, and, in 1965, Max Bense analyzed Birkhoff's measure from an i...
Jaume Rigau, Miquel Feixas, Mateu Sbert
ISCAS
2007
IEEE
152views Hardware» more  ISCAS 2007»
14 years 4 months ago
Reduced Complexity Space-Time-Frequency Model for Multi-Channel EEG and Its Applications
— Searching for an efficient summarization of multi-channel electroencephalogram (EEG) behavior is a challenging signal analysis problem. Recently, parallel factor analysis (PAR...
Yodchanan Wongsawat, Soontorn Oraintara, K. R. Rao
ICASSP
2008
IEEE
14 years 4 months ago
Query adaptative locality sensitive hashing
It is well known that high-dimensional nearest-neighbor retrieval is very expensive. Many signal processing methods suffer from this computing cost. Dramatic performance gains can...
Herve Jegou, Laurent Amsaleg, Cordelia Schmid, Pat...
ERSHOV
2009
Springer
14 years 4 months ago
On the Containment Problem for Queries in Conjunctive Form with Negation
Abstract. We consider the problem of query containment for conjunctive queries with safe negation property. A necessary and sufficient condition for two queries to be in containmen...
Victor Felea
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
14 years 10 months ago
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
In this work we study two, seemingly unrelated, notions. Locally Decodable Codes (LDCs) are codes that allow the recovery of each message bit from a constant number of entries of ...
Zeev Dvir, Amir Shpilka