17049 search results - page 95 / 3410 » cans 2007 |
APVIS
2004
13 years 10 months ago
2004
Program traces can be used to drive visualisations of reusable components, but such traces can be gigabytes in size, are very expensive to generate, and are hard to extract inform...
APVIS
2004
13 years 10 months ago
2004
Online component markets can be costly for consumers to use, in terms of the time and effort spent understanding the components on offer. This cost of understanding will deter con...
CLA
2006
13 years 10 months ago
2006
We present graded extension of the algorithm LinClosure. Graded LinClosure can be used to compute degrees of semantic entailment from sets of fuzzy attribute implications. It can a...
DATESO
2004
13 years 10 months ago
2004
Binary Factor Analysis (BFA, also known as Boolean Factor Analysis) may help with understanding collections of binary data. Since we can take collections of text documents as binar...
ESANN
2004
13 years 10 months ago
2004
In text-dependent speaker verification the speech signals have to be time-aligned. For that purpose dynamic time warping (DTW) can be used which performs the alignment by minimizi...