Sciweavers

4085 search results - page 452 / 817
» Benchmarking Data Mining Algorithms
Sort
View
IPPS
1998
IEEE
15 years 10 months ago
Optimizing Data Scheduling on Processor-in-Memory Arrays
In the study of PetaFlop project, Processor-In-Memory array was proposed to be a target architecture in achieving 1015 floating point operations per second computing performance. ...
Yi Tian, Edwin Hsing-Mean Sha, Chantana Chantrapor...
KDD
2007
ACM
168views Data Mining» more  KDD 2007»
16 years 6 months ago
A probabilistic framework for relational clustering
Relational clustering has attracted more and more attention due to its phenomenal impact in various important applications which involve multi-type interrelated data objects, such...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
LCPC
2005
Springer
15 years 11 months ago
Scalable Array SSA and Array Data Flow Analysis
Static Single Assignment (SSA) has been widely accepted as the intermediate program representation of choice in most modern compilers. It allows for a much more efficient data flo...
Silvius Rus, Guobin He, Lawrence Rauchwerger
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
16 years 6 months ago
Tensor-CUR decompositions for tensor-based data
Motivated by numerous applications in which the data may be modeled by a variable subscripted by three or more indices, we develop a tensor-based extension of the matrix CUR decom...
Michael W. Mahoney, Mauro Maggioni, Petros Drineas
RSS
2007
192views Robotics» more  RSS 2007»
15 years 7 months ago
Simultaneous Localisation and Mapping in Dynamic Environments (SLAMIDE) with Reversible Data Associa
Abstract— The conventional technique for dealing with dynamic objects in SLAM is to detect them and then either treat them as outliers [20][1] or track them separately using trad...
Charles Bibby, Ian D. Reid