Sciweavers

1093 search results - page 125 / 219
» Clustering from Constraint Graphs
Sort
View
138
Voted
DAC
1989
ACM
15 years 7 months ago
Scheduling and Binding Algorithms for High-Level Synthesis
- New algorithms for high-level synthesis are presented. The first performs scheduling under hardware resource constraints and improves on commonly used list scheduling techniques ...
Pierre G. Paulin, John P. Knight
125
Voted
NAACL
2003
15 years 5 months ago
Language choice models for microplanning and readability
This paper describes the construction of language choice models for the microplanning of discourse relations in a Natural Language Generation system that attempts to generate appr...
Sandra Williams
126
Voted
JCP
2006
111views more  JCP 2006»
15 years 3 months ago
Mining Developing Trends of Dynamic Spatiotemporal Data Streams
This paper1 presents an efficient modeling technique for data streams in a dynamic spatiotemporal environment and its suitability for mining developing trends. The streaming data a...
Yu Meng, Margaret H. Dunham
140
Voted
TCAD
1998
126views more  TCAD 1998»
15 years 3 months ago
Iterative remapping for logic circuits
Abstract—This paper presents an aggressive optimization technique targeting combinational logic circuits. Starting from an initial implementation mapped on a given technology lib...
Luca Benini, Patrick Vuillod, Giovanni De Micheli
137
Voted
ICCAD
1999
IEEE
125views Hardware» more  ICCAD 1999»
15 years 8 months ago
Direct synthesis of timed asynchronous circuits
This paper presents a new method to synthesize timed asynchronous circuits directly from the specification without generating a state graph. The synthesis procedure begins with a ...
Sung Tae Jung, Chris J. Myers