4039 search results - page 284 / 808 » A Method for Dynamic Clustering of Data |
191
click to vote
JLP
2006
15 years 6 months ago
2006
One of the goals of software engineering is to provide what is necessary to write relevant, legible, useful descriptions of the systems to be developed, which will be the basis of...
210
click to vote
ERCIMDL
2000
Springer
15 years 10 months ago
2000
Springer
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
169
click to vote
EUROPAR
2004
Springer
16 years 1 days ago
2004
Springer
OLAP queries are typically heavy-weight and ad-hoc thus requiring high storage capacity and processing power. In this paper, we address this problem using a database cluster which...
195
click to vote
ICIP
2008
IEEE
16 years 1 months ago
2008
IEEE
Dynamical shape priors are curical for level set-based nonrigid object tracking with noise, occlusions or background clutter. In this paper, we propose a level set tracking framew...
159
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we formulate the problem of grouping the states of a discrete Markov chain of arbitrary order simultaneously with deconvolving its transition probabilities. As the na...