Sciweavers

896 search results - page 123 / 180
» On completeness of word reversing
Sort
View
STACS
2004
Springer
15 years 5 months ago
On Minimum Circular Arrangement
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
Murali K. Ganapathy, Sachin Lodha
ICDAR
2003
IEEE
15 years 5 months ago
A Segmentation Method for Bibliographic References by Contextual Tagging of Fields
In this paper, a method based on part-of-speech tagging (PoS) is used for bibliographic reference structure. This method operates on a roughly structured ASCII file, produced by O...
Dominique Besagni, Abdel Belaïd, Nelly Benet
ISCAS
2003
IEEE
91views Hardware» more  ISCAS 2003»
15 years 5 months ago
Full-custom CMOS realization of a high-performance binary sorting engine with linear area-time complexity
The full-custom CMOS realization of a new modular sorting architecture is presented. The high-performance architecture is based on rank ordering, and on efficient implementation o...
Turan Demirci, Ilhan Hatirnaz, Yusuf Leblebici
ISLPED
2003
ACM
86views Hardware» more  ISLPED 2003»
15 years 5 months ago
Exploiting compiler-generated schedules for energy savings in high-performance processors
This paper develops a technique that uniquely combines the advantages of static scheduling and dynamic scheduling to reduce the energy consumed in modern superscalar processors wi...
Madhavi Gopal Valluri, Lizy Kurian John, Heather H...
CAV
2003
Springer
166views Hardware» more  CAV 2003»
15 years 5 months ago
Bridging the Gap between Fair Simulation and Trace Inclusion
The paper considers the problem of checking abstraction between two finite-state fair discrete systems (FDS). In automata-theoretic terms this is trace inclusion between two nond...
Yonit Kesten, Nir Piterman, Amir Pnueli