Sciweavers

1314 search results - page 111 / 263
» Approximate data mining in very large relational data
Sort
View
IPPS
2003
IEEE
15 years 7 months ago
Parallel ROLAP Data Cube Construction On Shared-Nothing Multiprocessors
The pre-computation of data cubes is critical to improving the response time of On-Line Analytical Processing (OLAP) systems and can be instrumental in accelerating data mining tas...
Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andre...
BIODATAMINING
2008
117views more  BIODATAMINING 2008»
15 years 1 months ago
Search extension transforms Wiki into a relational system: A case for flavonoid metabolite database
Background: In computer science, database systems are based on the relational model founded by Edgar Codd in 1970. On the other hand, in the area of biology the word 'databas...
Masanori Arita, Kazuhiro Suwa
ICDE
2006
IEEE
154views Database» more  ICDE 2006»
15 years 7 months ago
Efficient Image Classification on Vertically Decomposed Data
Organizing digital images into semantic categories is imperative for effective browsing and retrieval. In large image collections, an efficient algorithm is crucial to quickly cat...
Taufik Abidin, Aijuan Dong, Honglin Li, William Pe...
ISPASS
2009
IEEE
15 years 8 months ago
Lonestar: A suite of parallel irregular programs
Until recently, parallel programming has largely focused on the exploitation of data-parallelism in dense matrix programs. However, many important application domains, including m...
Milind Kulkarni, Martin Burtscher, Calin Cascaval,...
JMLR
2011
106views more  JMLR 2011»
14 years 8 months ago
A Bayesian Approximation Method for Online Ranking
This paper describes a Bayesian approximation method to obtain online ranking algorithms for games with multiple teams and multiple players. Recently for Internet games large onli...
Ruby C. Weng, Chih-Jen Lin