Sciweavers

477 search results - page 60 / 96
» Algorithms for dynamic geometric problems over data streams
Sort
View
NIPS
2001
13 years 10 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
Pascal Vincent, Yoshua Bengio
CVPR
2007
IEEE
14 years 2 months ago
A Graph Reduction Method for 2D Snake Problems
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
Jianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching...
ICCV
2003
IEEE
14 years 10 months ago
Dynamic Stroke Information Analysis for Video-Based Handwritten Chinese Character Recognition
Video-based handwritten Character Recognition (VCR) system is a new type of character recognition system with many unique advantages over on-line character recognition system. Its...
Feng Lin, Xiaoou Tang
CORR
2011
Springer
172views Education» more  CORR 2011»
13 years 2 days ago
Uncovering the Temporal Dynamics of Diffusion Networks
Time plays an essential role in the diffusion of information, influence and disease over networks. In many cases we only observe when a node copies information, makes a decision ...
Manuel Gomez-Rodriguez, David Balduzzi, Bernhard S...
ISAAC
2009
Springer
101views Algorithms» more  ISAAC 2009»
14 years 3 months ago
Maintaining Nets and Net Trees under Incremental Motion
The problem of maintaining geometric structures for points in motion has been well studied over the years. Much theoretical work to date has been based on the assumption that point...
Minkyoung Cho, David M. Mount, Eunhui Park