2629 search results - page 54 / 526 » complex 2009 |
225
click to vote
SIGMOD
2009
ACM
16 years 2 months ago
2009
ACM
Most information extraction (IE) approaches have considered only static text corpora, over which we apply IE only once. Many real-world text corpora however are dynamic. They evol...
136
Voted
FOCS
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract— We consider the problem of estimating cascaded aggregates over a matrix presented as a sequence of updates in a data stream. A cascaded aggregate P ◦Q is defined by ...
150
Voted
COCO
2009
Springer
15 years 9 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
120
Voted
MFCS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. A Solovay function is a computable upper bound g for prefixfree Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constan...
126
Voted
ICCV
2009
IEEE
16 years 7 months ago
2009
IEEE
Human activity recognition is a challenging task, especially
when its background is unknown or changing,
and when scale or illumination differs in each video.
Approaches utilizi...