Sciweavers

123 search results - page 21 / 25
» Counting inversions in lists
Sort
View
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 8 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
ICDT
2010
ACM
219views Database» more  ICDT 2010»
14 years 5 months ago
Aggregate Queries for Discrete and Continuous Probabilistic XML
Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database mode...
Serge Abiteboul, T.-H Hubert Chan, Evgeny Kharlamo...
CEAS
2005
Springer
14 years 1 months ago
Experiences with Greylisting
Greylisting temporarily rejects mail from unknown sources on the theory that real mailers will retry while spamware won’t. I outline a taxonomy of greylisters and report some st...
John R. Levine
FSMNLP
2005
Springer
14 years 1 months ago
German Compound Analysis with wfsc
Compounding is a very productive process in German to form complex nouns and adjectives which represent about 7% of the words of a newspaper text. Unlike English, German compounds ...
Anne Schiller
MIR
2004
ACM
176views Multimedia» more  MIR 2004»
14 years 1 months ago
Analysing the performance of visual, concept and text features in content-based video retrieval
This paper describes revised content-based search experiments in the context of TRECVID 2003 benchmark. Experiments focus on measuring content-based video retrieval performance wi...
Mika Rautiainen, Timo Ojala, Tapio Seppänen