Sciweavers

2009 search results - page 118 / 402
» Dense Interest Points
Sort
View
CORR
2010
Springer
189views Education» more  CORR 2010»
13 years 6 months ago
Robust PCA via Outlier Pursuit
Singular Value Decomposition (and Principal Component Analysis) is one of the most widely used techniques for dimensionality reduction: successful and efficiently computable, it ...
Huan Xu, Constantine Caramanis, Sujay Sanghavi
GIS
2008
ACM
14 years 9 months ago
Computing isochrones in multi-modal, schedule-based transport networks
Isochrones are defined as the set of all points from which a specific point of interest is reachable within a given time span. This demo paper presents a solution to compute isoch...
Veronika Bauer, Johann Gamper, Roberto Loperfido, ...
ICIP
2009
IEEE
14 years 9 months ago
Recognizing Human Actions By Fusing Spatio-temporal Appearance And Motion Descriptors
In this paper we propose a new method for human action categorization by using an effective combination of a new 3D gradient descriptor with an optic flow descriptor, to represent...
CSL
2004
Springer
14 years 1 months ago
Structures for Multiplicative Cyclic Linear Logic: Deepness vs Cyclicity
The aim of this work is to give an alternative presentation for the multiplicative fragment of Yetter’s cyclic linear logic. The new presentation is inspired by the calculus of s...
Pietro Di Gianantonio
CCCG
2007
13 years 9 months ago
Approximating k-hop Minimum Spanning Trees in Euclidean Metrics
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...
Sören Laue, Domagoj Matijevic