2925 search results - page 371 / 585 » Information Complexity of Online Problems |
258
click to vote
LCC
1994
15 years 8 months ago
1994
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
120
click to vote
APAL
2010
15 years 4 months ago
2010
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
279
click to vote
ICDE
2008
IEEE
16 years 6 months ago
2008
IEEE
In this paper we explore database segmentation in the context of a column-store DBMS targeted at a scientific database. We present a novel hardware- and scheme-oblivious segmentati...
139
Voted
HPCA
2005
IEEE
16 years 4 months ago
2005
IEEE
This paper studies the impact of L2 cache sharing on threads that simultaneously share the cache, on a Chip Multi-Processor (CMP) architecture. Cache sharing impacts threads non-u...
138
click to vote
PODS
2007
ACM
16 years 4 months ago
2007
ACM
Event processing systems have wide applications ranging from managing events from RFID readers to monitoring RSS feeds. Consequently, there exists much work on them in the literat...