Sciweavers

1661 search results - page 53 / 333
» Space-time Interest Points
Sort
View
JAT
2002
62views more  JAT 2002»
14 years 9 months ago
Coconvex Approximation
Let f C[-1, 1] change its convexity finitely many times, in the interval. We are interested in estimating the degree of approximation of f by polynomials which are coconvex with i...
Dany Leviatan, Igor A. Shevchuk
CVPR
2012
IEEE
13 years 7 days ago
A theory of multi-layer flat refractive geometry
Flat refractive geometry corresponds to a perspective camera looking through single/multiple parallel flat refractive mediums. We show that the underlying geometry of rays corres...
Amit Agrawal, Srikumar Ramalingam, Yuichi Taguchi,...
IVS
2008
121views more  IVS 2008»
14 years 9 months ago
Using treemaps for variable selection in spatio-temporal visualisation
We demonstrate and reflect upon the use of enhanced treemaps that incorporate spatial and temporal ordering for exploring a large multivariate spatio-temporal data set. The result...
Aidan Slingsby, Jason Dykes, Jo Wood
ICDE
2009
IEEE
180views Database» more  ICDE 2009»
15 years 11 months ago
Reverse Furthest Neighbors in Spatial Databases
Given a set of points P and a query point q, the reverse furthest neighbor (RFN) query fetches the set of points p P such that q is their furthest neighbor among all points in P {...
Bin Yao, Feifei Li, Piyush Kumar
ISAAC
2007
Springer
183views Algorithms» more  ISAAC 2007»
15 years 4 months ago
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, So...