Sciweavers

18155 search results - page 139 / 3631
» Point
Sort
View
CVPR
2009
IEEE
16 years 9 months ago
Harris Corners in the Real World: A Principled Selection Criterion for Interest Points Based on Ecological Statistics
In this report, we consider whether statistical regularities in natural images might be exploited to provide an improved selection criterion for interest points. One approach that ...
Neil D. B. Bruce, Pierre Kornprobst
STOC
2009
ACM
136views Algorithms» more  STOC 2009»
16 years 2 months ago
Random walks on polytopes and an affine interior point method for linear programming
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
Ravi Kannan, Hariharan Narayanan
EICS
2009
ACM
15 years 8 months ago
The tradeoff between spatial jitter and latency in pointing tasks
Interactive computing systems frequently use pointing as an input modality, while also supporting other forms of input such as alphanumeric, voice, gesture, and force. We focus on...
Andriy Pavlovych, Wolfgang Stürzlinger
PSIVT
2007
Springer
110views Multimedia» more  PSIVT 2007»
15 years 7 months ago
Measuring Linearity of Ordered Point Sets
It is often practical to measure how linear a certain ordered set of points is. We are interested in linearity measures which are invariant to rotation, scaling, and translation. T...
Milos Stojmenovic, Amiya Nayak
127
Voted
RTSS
2006
IEEE
15 years 7 months ago
Tightening the Bounds on Feasible Preemption Points
Caches have become invaluable for higher-end architectures to hide, in part, the increasing gap between processor speed and memory access times. While the effect of caches on timi...
Harini Ramaprasad, Frank Mueller