Sciweavers

39 search results - page 3 / 8
» Bridges for Concatenation Hierarchies
Sort
View
DAC
1997
ACM
13 years 10 months ago
Multi-Way FPGA Partitioning by Fully Exploiting Design Hierarchy
In this paper, we present a new integrated synthesis and partitioning method for multiple-FPGA applications. This method rst synthesizes a design speci cation in a ne-grained way ...
Wen-Jong Fang, Allen C.-H. Wu
CSL
2007
Springer
14 years 20 days ago
Forest Expressions
We define regular expressions for unranked trees (actually, ordered sequences of unranked trees, called forests). These are compared to existing regular expressions for trees. On ...
Mikolaj Bojanczyk
SC
2009
ACM
14 years 1 months ago
Bridging parallel and reconfigurable computing with multilevel PGAS and SHMEM+
Reconfigurable computing (RC) systems based on FPGAs are becoming an increasingly attractive solution to building parallel systems of the future. Applications targeting such syste...
Vikas Aggarwal, Alan D. George, K. Yalamanchili, C...
CORR
2011
Springer
199views Education» more  CORR 2011»
13 years 1 months ago
From Machine Learning to Machine Reasoning
A plausible definition of "reasoning" could be "algebraically manipulating previously acquired knowledge in order to answer a new question". This definition co...
Léon Bottou
IEAAIE
2005
Springer
13 years 12 months ago
Discovering Learning Paths on a Domain Ontology Using Natural Language Interaction
The present work investigates the problem of determining a learning path inside a suitable domain ontology. The proposed approach enables the user of a web learning application to ...
Roberto Pirrone, Massimo Cossentino, Giovanni Pila...