Sciweavers

79 search results - page 10 / 16
» A New Reduction from 3SAT to n-Partite Graphs
Sort
View
COMAD
2009
13 years 9 months ago
Large Maximal Cliques Enumeration in Large Sparse Graphs
Identifying communities in social networks is a problem of great interest. One popular type of community is where every member of the community knows all others, which can be view...
Natwar Modani, Kuntal Dey
ICCAD
1999
IEEE
125views Hardware» more  ICCAD 1999»
14 years 8 days ago
Direct synthesis of timed asynchronous circuits
This paper presents a new method to synthesize timed asynchronous circuits directly from the specification without generating a state graph. The synthesis procedure begins with a ...
Sung Tae Jung, Chris J. Myers
ISCAS
2005
IEEE
183views Hardware» more  ISCAS 2005»
14 years 1 months ago
Battery-aware dynamic voltage scaling in multiprocessor embedded system
— In a battery powered system, a primary design consideration is the battery lifetime. Profile of current drawn from a battery determines its lifetime. Recently in [4] dynamic v...
Yuan Cai, Sudhakar M. Reddy, Irith Pomeranz, Bashi...
PRDC
2006
IEEE
14 years 2 months ago
Detecting and Exploiting Symmetry in Discrete-state Markov Models
Dependable systems are usually designed with multiple instances of components or logical processes, and often possess symmetries that may be exploited in model-based evaluation. T...
W. Douglas Obal II, Michael G. McQuinn, William H....
INFOCOM
2009
IEEE
14 years 2 months ago
Robust Counting Via Counter Braids: An Error-Resilient Network Measurement Architecture
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
Yi Lu, Balaji Prabhakar