Sciweavers

10848 search results - page 2011 / 2170
» Programming in Biomolecular Computation
Sort
View
FCCM
2011
IEEE
241views VLSI» more  FCCM 2011»
14 years 10 months ago
Multilevel Granularity Parallelism Synthesis on FPGAs
— Recent progress in High-Level Synthesis (HLS) es has helped raise the abstraction level of FPGA programming. However implementation and performance evaluation of the HLS-genera...
Alexandros Papakonstantinou, Yun Liang, John A. St...
CHI
2011
ACM
14 years 10 months ago
Collaborative creativity: a complex systems model with distributed affect
The study of creativity has received significant attention over the past century, with a recent increase in interest in collaborative, distributed creativity. We posit that creati...
Cecilia R. Aragon, Alison Williams
HPCA
2011
IEEE
14 years 10 months ago
MOPED: Orchestrating interprocess message data on CMPs
Future CMPs will combine many simple cores with deep cache hierarchies. With more cores, cache resources per core are fewer, and must be shared carefully to avoid poor utilization...
Junli Gu, Steven S. Lumetta, Rakesh Kumar, Yihe Su...
SIGMOD
2007
ACM
224views Database» more  SIGMOD 2007»
16 years 6 months ago
Design of flash-based DBMS: an in-page logging approach
The popularity of high-density flash memory as data storage media has increased steadily for a wide spectrum of computing devices such as PDA's, MP3 players, mobile phones an...
Sang-Won Lee, Bongki Moon
DIMACS
1996
15 years 7 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
« Prev « First page 2011 / 2170 Last » Next »