Sciweavers

462 search results - page 37 / 93
» An application of almost increasing sequences
Sort
View
PAMI
2010
242views more  PAMI 2010»
13 years 5 months ago
Spatiotemporal Saliency in Dynamic Scenes
—A spatiotemporal saliency algorithm based on a center-surround framework is proposed. The algorithm is inspired by biological mechanisms of motion-based perceptual grouping and ...
Vijay Mahadevan, Nuno Vasconcelos
ICCV
2003
IEEE
14 years 9 months ago
Surface Reconstruction by Integrating 3D and 2D Data of Multiple Views
Surface representation is needed for almost all modeling and visualization applications, but unfortunately, 3D data from a passive vision system are often insufficient for a tradi...
Maxime Lhuillier, Long Quan
COCOON
2007
Springer
14 years 1 months ago
Streaming Algorithms Measured in Terms of the Computed Quantity
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
Shengyu Zhang
CHES
2006
Springer
111views Cryptology» more  CHES 2006»
13 years 11 months ago
Cache-Collision Timing Attacks Against AES
This paper describes several novel timing attacks against the common table-driven software implementation of the AES cipher. We define a general attack strategy using a simplified ...
Joseph Bonneau, Ilya Mironov
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
13 years 9 months ago
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
Spyros Angelopoulos