Sciweavers

1458 search results - page 62 / 292
» Practical Preference Relations for Large Data Sets
Sort
View
PADL
2000
Springer
15 years 8 months ago
Calculating a New Data Mining Algorithm for Market Basket Analysis
The general goal of data mining is to extract interesting correlated information from large collection of data. A key computationally-intensive subproblem of data mining involves ...
Zhenjiang Hu, Wei-Ngan Chin, Masato Takeichi
CVPR
1999
IEEE
16 years 7 months ago
Robust Visual Servoing based on Relative Orientation
In this paper the problem of controlling the spatial position and orientation of a robotic platform based on the image data obtained from a video camera mounted on that platform i...
Camillo J. Taylor, James P. Ostrowski, Sang-Hack J...
ICASSP
2009
IEEE
15 years 11 months ago
A study on multilingual acoustic modeling for large vocabulary ASR
We study key issues related to multilingual acoustic modeling for automatic speech recognition (ASR) through a series of large-scale ASR experiments. Our study explores shared str...
Hui Lin, Li Deng, Dong Yu, Yifan Gong, Alex Acero,...
BMCBI
2008
138views more  BMCBI 2008»
15 years 5 months ago
Combining transcriptional datasets using the generalized singular value decomposition
Background: Both microarrays and quantitative real-time PCR are convenient tools for studying the transcriptional levels of genes. The former is preferable for large scale studies...
Andreas W. Schreiber, Neil J. Shirley, Rachel A. B...
HIPC
2007
Springer
15 years 11 months ago
Experiments with a Parallel External Memory System
Abstract. The theory of bulk-synchronous parallel computing has produced a large number of attractive algorithms, which are provably optimal in some sense, but typically require th...
Mohammad R. Nikseresht, David A. Hutchinson, Anil ...