Sciweavers

4198 search results - page 319 / 840
» Data Parallel Program Design
Sort
View
CIB
2005
41views more  CIB 2005»
15 years 4 months ago
A Partial-Repeatability Approach to Data Mining
Unlike the data approached in traditional data mining activities, software data are featured with partial-repeatability or parepeatics, which is an invariant property that can neit...
Kai-Yuan Cai, Yunfei Yin, Shichao Zhang
PLDI
2011
ACM
14 years 7 months ago
Data representation synthesis
We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both declarative lts in provably correct code. In our approach, abst...
Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin...
EUMAS
2006
15 years 5 months ago
A Customizable Multi-Agent System for Distributed Data Mining
We present a general Multi-Agent System framework for distributed data mining based on a Peer-toPeer model. The framework adopts message-based asynchronous communication and a dyn...
Giancarlo Fortino, Giuseppe Di Fatta
ISCA
2011
IEEE
313views Hardware» more  ISCA 2011»
14 years 8 months ago
FabScalar: composing synthesizable RTL designs of arbitrary cores within a canonical superscalar template
A growing body of work has compiled a strong case for the single-ISA heterogeneous multi-core paradigm. A single-ISA heterogeneous multi-core provides multiple, differently-design...
Niket Kumar Choudhary, Salil V. Wadhavkar, Tanmay ...
OSDI
2008
ACM
16 years 4 months ago
Digging for Data Structures
Because writing computer programs is hard, computer programmers are taught to use encapsulation and modularity to hide complexity and reduce the potential for errors. Their progra...
Anthony Cozzie, Frank Stratton, Hui Xue, Samuel T....