Sciweavers

2463 search results - page 125 / 493
» Rankings of Directed Graphs
Sort
View
ASPDAC
2000
ACM
95views Hardware» more  ASPDAC 2000»
14 years 1 months ago
FSM decomposition by direct circuit manipulation applied to low power design
Abstract— Clock-gating techniques are very effective in the reduction of the switching activity in sequential logic circuits. In particular, recent work has shown that significa...
José C. Monteiro, Arlindo L. Oliveira
PEPM
1997
ACM
14 years 1 months ago
Annotation-Directed Run-Time Specialization in C
We present the design of a dynamic compilation system for C. Directed by a few declarative user annotations specifying where and on what dynamic compilation is to take place, a bi...
Brian Grant, Markus Mock, Matthai Philipose, Craig...
CORR
2007
Springer
107views Education» more  CORR 2007»
13 years 9 months ago
Morphological annotation of Korean with Directly Maintainable Resources
This article describes an exclusively resource-based method of morphological annotation of written Korean text. Korean is an agglutinative language. Our annotator is designed to p...
Ivan Berlocher, Hyun-Gue Huh, Eric Laporte, Jee-Su...
INFOCOM
2010
IEEE
13 years 7 months ago
Joint Routing and Scheduling in Multi-hop Wireless Networks with Directional Antennas
Long-distance multi-hop wireless networks have been used in recent years to provide connectivity to rural areas. The salient features of such networks include TDMA channel access, ...
Partha Dutta, Vivek Mhatre, Debmalya Panigrahi, Ra...
APPROX
2011
Springer
242views Algorithms» more  APPROX 2011»
12 years 9 months ago
New Tools for Graph Coloring
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
Sanjeev Arora, Rong Ge