Sciweavers

1221 search results - page 221 / 245
» Balanced graph partitioning
Sort
View
131
Voted
VLSID
2002
IEEE
98views VLSI» more  VLSID 2002»
16 years 4 months ago
On Test Scheduling for Core-Based SOCs
We present a mathematical model for the problem of scheduling tests for core-based system-on-chip (SOC) VLSI designs. Given a set of tests for each core in the SOC and a set of te...
Sandeep Koranne
157
Voted
CADE
2007
Springer
16 years 4 months ago
Dependency Pairs for Rewriting with Non-free Constructors
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
Stephan Falke, Deepak Kapur
ICCAD
2005
IEEE
98views Hardware» more  ICCAD 2005»
16 years 24 days ago
Clustering for processing rate optimization
Clustering (or partitioning) is a crucial step between logic synthesis and physical design in the layout of a large scale design. A design verified at the logic synthesis level m...
Chuan Lin, Jia Wang, Hai Zhou
IUI
2009
ACM
16 years 23 days ago
Structuring and manipulating hand-drawn concept maps
Concept maps are an important tool to knowledge organization, representation, and sharing. Most current concept map tools do not provide full support for hand-drawn concept map cr...
Yingying Jiang, Feng Tian, XuGang Wang, Xiaolong Z...
CVPR
2010
IEEE
15 years 11 months ago
Efficient Piecewise Learning for Conditional Random Fields
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
Karteek Alahari, Phil Torr