12257 search results - page 41 / 2452 » Analysis of Algorithms |
177
click to vote
PARA
2004
Springer
15 years 11 months ago
2004
Springer
It is known that in general, statistical analysis of interval data is an NP-hard problem: even computing the variance of interval data is, in general, NP-hard. Until now, only one ...
168
click to vote
ICCD
2004
IEEE
16 years 2 months ago
2004
IEEE
This paper presents a novel approach to reducing the complexity of the transient linear circuit analysis for a hybrid structured clock network. Topology reduction is first used to...
159
click to vote
IJCAI
2003
15 years 7 months ago
2003
The intelligent tutoring system AutoTutor uses latent semantic analysis to evaluate student answers to the tutor's questions. By comparing a student's answer to a set of...
154
click to vote
ICA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this paper, we consider the Independent Component Analysis problem when the hidden sources are non-negative (Non-negative ICA). This problem is formulated as a non-lin...
141
click to vote
SPIRE
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. This work presents an experimental comparison of intersection algorithms for sorted sequences, including the recent algorithm of Baeza-Yates. This algorithm performs on a...