Sciweavers

2523 search results - page 288 / 505
» Objective: In Minimum Context
Sort
View
JMIV
2007
156views more  JMIV 2007»
15 years 6 months ago
Using the Shape Gradient for Active Contour Segmentation: from the Continuous to the Discrete Formulation
A variational approach to image or video segmentation consists in defining an energy depending on local or global image characteristics, the minimum of which being reached for ob...
Eric Debreuve, Muriel Gastaud, Michel Barlaud, Gil...
TSP
2008
106views more  TSP 2008»
15 years 6 months ago
Guaranteeing Practical Convergence in Algorithms for Sensor and Source Localization
This paper considers localization of a source or a sensor from distance measurements. We argue that linear algorithms proposed for this purpose are susceptible to poor noise perfor...
Baris Fidan, Soura Dasgupta, Brian D. O. Anderson
CORR
1998
Springer
82views Education» more  CORR 1998»
15 years 6 months ago
Name Strategy: Its Existence and Implications
It is argued that colour name strategy, object name strategy, and chunking strategy in memory are all aspects of the same general phenomena, called stereotyping, and this in turn ...
Mark D. Roberts
IJFCS
1998
67views more  IJFCS 1998»
15 years 6 months ago
Vertex Splitting in Dags and Applications to Partial Scan Designs and Lossy Circuits
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...
Doowon Paik, Sudhakar M. Reddy, Sartaj Sahni
JMLR
2002
106views more  JMLR 2002»
15 years 6 months ago
Some Greedy Learning Algorithms for Sparse Regression and Classification with Mercer Kernels
We present some greedy learning algorithms for building sparse nonlinear regression and classification models from observational data using Mercer kernels. Our objective is to dev...
Prasanth B. Nair, Arindam Choudhury 0002, Andy J. ...