Sciweavers

455 search results - page 13 / 91
» Dynamic well-spaced point sets
Sort
View
KDD
2002
ACM
155views Data Mining» more  KDD 2002»
15 years 10 months ago
SyMP: an efficient clustering approach to identify clusters of arbitrary shapes in large data sets
We propose a new clustering algorithm, called SyMP, which is based on synchronization of pulse-coupled oscillators. SyMP represents each data point by an Integrate-and-Fire oscill...
Hichem Frigui
AUTOMATICA
1999
119views more  AUTOMATICA 1999»
14 years 9 months ago
Robust L2-gain control for nonlinear systems with projection dynamics and input constraints: an example from traffic control
We formulate the L2-gain control problem for a general nonlinear, state-space system with projection dynamics in the state evolution and hard constraints on the set of admissible ...
Joseph A. Ball, Martin V. Day, Tungsheng Yu, Pushk...
ICIP
2003
IEEE
15 years 11 months ago
Robust object boundary determination using a locally adaptive level set algorithm
This paper introduces a level set methodology for the precise boundary localization of image objects within an indicated region, designed to be particularly robust against weak or...
Eftychios Sifakis, George Tziritas
WSCG
2003
145views more  WSCG 2003»
14 years 11 months ago
Analysis of Four-Dimensional Cardiac Data Sets Using Skeleton-Based Segmentation
Computer-aided analysis of four-dimensional tomography data has become an important tool in modern cardiology. In order to examine the capability and health of a patient’s cardi...
André Neubauer, Rainer Wegenkittl
INFOCOM
2006
IEEE
15 years 3 months ago
Nomadic Service Points
— We consider the novel problem of dynamically assigning application sessions of mobile users or user groups to service points. Such assignments must balance the tradeoff between...
Edward Bortnikov, Israel Cidon, Idit Keidar