Sciweavers

594 search results - page 48 / 119
» Using Approximation to Relate Computational Classes over the...
Sort
View
ICALP
2005
Springer
14 years 2 months ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos
TCS
1998
13 years 8 months ago
Foundations of Aggregation Constraints
We introduce a new constraint domain, aggregation constraints, that is useful in database query languages, and in constraint logic programming languages that incorporate aggregate...
Kenneth A. Ross, Divesh Srivastava, Peter J. Stuck...
WAW
2004
Springer
150views Algorithms» more  WAW 2004»
14 years 2 months ago
Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations
d Abstract) Paolo Boldi† Massimo Santini‡ Sebastiano Vigna∗ Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often debated issue i...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
ECCV
2008
Springer
14 years 10 months ago
Scale Invariant Action Recognition Using Compound Features Mined from Dense Spatio-temporal Corners
Abstract. The use of sparse invariant features to recognise classes of actions or objects has become common in the literature. However, features are often "engineered" to...
Andrew Gilbert, John Illingworth, Richard Bowden
BMVC
2010
13 years 6 months ago
The Fastest Pedestrian Detector in the West
We demonstrate a multiscale pedestrian detector operating in near real time (5 fps on 640x480 images) with state-of-the-art detection performance. The computational bottleneck of ...
Piotr Dollár, Serge Belongie, Pietro Perona