Sciweavers

848 search results - page 77 / 170
» Randomness and the linear degrees of computability
Sort
View
PG
2007
IEEE
15 years 6 months ago
Visualisation of Implicit Algebraic Curves
We describe a new algorithm for the visualisation of implicit algebraic curves, which isolates the singular points, compute the topological degree around these points in order to ...
Lionel Alberti, Bernard Mourrain
HYBRID
2003
Springer
15 years 5 months ago
Reachability Analysis of Nonlinear Systems Using Conservative Approximation
Abstract. In this paper we present an approach to approximate reachability computation for nonlinear continuous systems. Rather than studying a complex nonlinear system ˙x = g(x),...
Eugene Asarin, Thao Dang, Antoine Girard
109
Voted
JPDC
2007
112views more  JPDC 2007»
14 years 11 months ago
Distributed algorithms for connected domination in wireless networks
We present fast distributed local control Connected Dominating Set (CDS) algorithms for wireless ad hoc networks. We present two randomized distributed algorithms, CDSColor and CD...
Rajiv Gandhi, Srinivasan Parthasarathy 0002
ICCV
2003
IEEE
16 years 1 months ago
Learning a Classification Model for Segmentation
We propose a two-class classification model for grouping. Human segmented natural images are used as positive examples. Negative examples of grouping are constructed by randomly m...
Xiaofeng Ren, Jitendra Malik
ICPR
2010
IEEE
15 years 6 months ago
Heterogeneous Face Recognition: Matching NIR to Visible Light Images
Matching near-infrared (NIR) face images to visible light (VIS) face images offers a robust approach to face recognition with unconstrained illumination. In this paper we propose ...
Brendan Klare, Anil Jain