Sciweavers

6455 search results - page 145 / 1291
» Research problems
Sort
View
IJFCS
1998
67views more  IJFCS 1998»
15 years 6 months ago
Vertex Splitting in Dags and Applications to Partial Scan Designs and Lossy Circuits
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...
Doowon Paik, Sudhakar M. Reddy, Sartaj Sahni
ACL
1994
15 years 7 months ago
An Automatic Treebank Conversion Algorithm for Corpus Sharing
An automatic treebank conversion method is proposed in this paper to convert a treebank into another treebank. A new treebank associated with a different grammar can be generated ...
Jong-Nae Wang, Jing-Shin Chang, Keh-Yih Su
IANDC
1998
64views more  IANDC 1998»
15 years 6 months ago
Positive Versions of Polynomial Time
We show that restricting a number of characterizations of the complexity class P to be positive (in natural ways) results in the same class of (monotone) problems which we denote ...
Clemens Lautemann, Thomas Schwentick, Iain A. Stew...
HICSS
2008
IEEE
111views Biometrics» more  HICSS 2008»
16 years 25 days ago
Cooperation and Coordination in Decentralized Communication Networks
Research has shown that decentralized networks and organizations perform better and have more satisfied members than centralized ones. Further, decentralized self-organizing netwo...
Devan Rosen
FPGA
2006
ACM
125views FPGA» more  FPGA 2006»
15 years 10 months ago
Armada: timing-driven pipeline-aware routing for FPGAs
While previous research has shown that FPGAs can efficiently implement many types of computations, their flexibility inherently limits their clock rate. Several research groups ha...
Kenneth Eguro, Scott Hauck