Sciweavers

209 search results - page 4 / 42
» The Computational Complexity of Weak Saddles
Sort
View
HAPTICS
2011
IEEE
12 years 11 months ago
Weak spatial constancy in touch
We propose extending the concept of spatial constancy to haptic perception. In vision, spatial constancy refers to the conversion of retinotopic signals into spatiotopic represent...
Mark Wexler, Vincent Hayward
SIGECOM
2005
ACM
97views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
Complexity of (iterated) dominance
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
Vincent Conitzer, Tuomas Sandholm
VIS
2008
IEEE
134views Visualization» more  VIS 2008»
14 years 8 months ago
A Practical Approach to Morse-Smale Complex Computation: Scalability and Generality
The Morse-Smale (MS) complex has proven to be a useful tool in extracting and visualizing features from scalar-valued data. However, efficient computation of the MS complex for lar...
Attila Gyulassy, Peer-Timo Bremer, Bernd Hamann,...
ECCV
2004
Springer
14 years 9 months ago
Weak Hypotheses and Boosting for Generic Object Detection and Recognition
In this paper we describe the first stage of a new learning system for object detection and recognition. For our system we propose Boosting [5] as the underlying learning technique...
Andreas Opelt, Michael Fussenegger, Axel Pinz, Pet...
ECCTD
2011
108views more  ECCTD 2011»
12 years 7 months ago
Low complexity least-squares filter design for the correction of linear time-varying systems
Abstract—In this paper, a low complexity algorithm for the design of a time-varying correction filter of finite impulse response (FIR) type is presented. Using the obtained fi...
Michael Soudan, Christian Vogel