Sciweavers

1964 search results - page 17 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
CASES
2007
ACM
13 years 11 months ago
An efficient framework for dynamic reconfiguration of instruction-set customization
We present an efficient framework for dynamic reconfiguration of application-specific custom instructions. A key component of this framework is an iterative algorithm for temporal...
Huynh Phung Huynh, Joon Edward Sim, Tulika Mitra
IPPS
1996
IEEE
13 years 11 months ago
An Element-Based Concurrent Partitioner for Unstructured Finite Element Meshes
A concurrent partitioner for partitioning unstructured finite element meshes on distributed memory architectures is developed. The partitioner uses an element-based partitioning st...
Hong Q. Ding, Robert D. Ferraro
ICDAR
2009
IEEE
13 years 5 months ago
Robust Extraction of Text from Camera Images
Text within a camera grabbed image can contain a huge amount of meta data about that scene. Such meta data can be useful for identification, indexing and retrieval purposes. Detec...
Shyama Prosad Chowdhury, Soumyadeep Dhar, Amit Kum...
ISPD
1999
ACM
126views Hardware» more  ISPD 1999»
13 years 12 months ago
Partitioning by iterative deletion
Netlist partitioning is an important and well studied problem. In this paper, a linear time partitioning approach based on iterative deletion is presented. We use the partitioning...
Patrick H. Madden
JAL
2002
71views more  JAL 2002»
13 years 7 months ago
A primal-dual schema based approximation algorithm for the element connectivity problem
The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint pa...
Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani, Dav...