Sciweavers

2009 search results - page 37 / 402
» Dense Interest Points
Sort
View
116
Voted
CORR
2010
Springer
66views Education» more  CORR 2010»
15 years 3 months ago
Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems
A pseudorandom point in an ergodic dynamical system over a computable metric space is a point which is computable but its dynamics has the same statistical behavior of a typical po...
Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas
IMR
2003
Springer
15 years 9 months ago
Meshing of Diffusion Surfaces for Point-Based Tensor Field Visualization
The visualization of 3D vector and tensor fields in a 2D image is challenging because the large amount of information will either be mixed during projection to 2D or lead to seve...
Ralf Sondershaus, Stefan Gumhold
CP
2007
Springer
15 years 7 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
PAMI
2008
189views more  PAMI 2008»
15 years 3 months ago
A Marked Point Process of Rectangles and Segments for Automatic Analysis of Digital Elevation Models
This work presents a framework for automatic feature extraction from images using stochastic geometry. Features in images are modeled as realizations of a spatial point process of ...
Mathias Ortner, Xavier Descombes, Josiane Zerubia
INFOCOM
2012
IEEE
13 years 6 months ago
SAP: Smart Access Point with seamless load balancing multiple interfaces
Abstract—Providing adequate Wi-Fi services to meet user demand in densely populated environments has been a fundamental challenge for Wi-Fi networks. In this paper, we explore th...
Xi Chen, Yue Zhao, Brian Peck, Daji Qiao