973 search results - page 142 / 195 » New Bounds on Crossing Numbers |
160
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
140
click to vote
ISPD
1998
ACM
15 years 10 months ago
1998
ACM
Wirelength estimation in VLSI layout is fundamental to any pre-detailed routing estimate of timing or routability. In this paper, we develop e cient wirelength estimation techniqu...
183
click to vote
PDPTA
2004
15 years 7 months ago
2004
High-throughput real-time systems require non-standard and costly hardware and software solutions. Modern workstation can represent a credible alternative to develop realtime inte...
154
click to vote
JEC
2006
15 years 6 months ago
2006
Many applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). In our previous work, we proposed a ...
167
click to vote
ML
2008
ACM
15 years 6 months ago
2008
ACM
Abstract We present a new margin-based approach to first-order rule learning. The approach addresses many of the prominent challenges in first-order rule learning, such as the comp...