773 search results - page 129 / 155 » Traversing the Machining Graph |
ICCAD
1992
IEEE
15 years 1 months ago
1992
IEEE
High-level synthesis (HLS) requires more designer interaction to better meet the needs of experienced designers. However, attempts to create a highly interactive synthesis process...
ICALP
2000
Springer
15 years 1 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
ICS
1995
Tsinghua U.
15 years 1 months ago
1995
Tsinghua U.
Modulo scheduling is an e cient technique for exploiting instruction level parallelism in a variety of loops, resulting in high performance code but increased register requirement...
VL
1995
IEEE
15 years 1 months ago
1995
IEEE
Diagrams (e.g., flowcharts, trees for hierarchical structures, or graphs for finite state machines) are often needed as part of visual language systems and advanced user interfa...
AAAI
2008
14 years 12 months ago
2008
Multiple instance learning (MIL) is a branch of machine learning that attempts to learn information from bags of instances. Many real-world applications such as localized content-...