14382 search results - page 304 / 2877 » Time in Connectionist Models |
184
click to vote
JCST
2010
15 years 1 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
173
click to vote
NIPS
2003
15 years 8 months ago
2003
We propose a functional mixture model for simultaneous clustering and alignment of sets of curves measured on a discrete time grid. The model is specifically tailored to gene exp...
147
click to vote
ICDM
2005
IEEE
16 years 7 days ago
2005
IEEE
Monotonicity is a simple yet significant qualitative characteristic. We consider the problem of segmenting an array in up to K segments. We want segments to be as monotonic as po...
154
Voted
AH
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. In this paper we present an approach to time-based adaptation in adaptive hypermedia systems. Time is used as a part of the context (or environment) model. We have propos...
148
click to vote
DAC
2005
ACM
15 years 8 months ago
2005
ACM
Traditional corner analysis fails to guarantee a target yield for a given performance metric. However, recently proposed solutions, in the form of statistical timing analysis, whi...