Sciweavers

205 search results - page 35 / 41
» Pruning 2-Connected Graphs
Sort
View
61
Voted
DATE
2010
IEEE
127views Hardware» more  DATE 2010»
15 years 2 months ago
A generalized control-flow-aware pattern recognition algorithm for behavioral synthesis
— Pattern recognition has many applications in design automation. A generalized pattern recognition algorithm is presented in this paper which can efficiently extract similar pat...
Jason Cong, Hui Huang, Wei Jiang
ICPR
2002
IEEE
15 years 2 months ago
Image Flows and One-Liner Graphical Image Representation
In this paper we introduce a novel graphical image representation comprising a single curve—the one-liner. The first step involves the detection and linking of image edges. We ...
Vadim Makhervaks, Gill Barequet, Alfred M. Bruckst...
ISSS
2000
IEEE
127views Hardware» more  ISSS 2000»
15 years 2 months ago
Lower Bound Estimation for Low Power High-Level Synthesis
This paper addresses the problem of estimating lower bounds on the power consumption in scheduled data flow graphs with a fixed number of allocated resources prior to binding. T...
Lars Kruse, Eike Schmidt, Gerd Jochens, Ansgar Sta...
DIS
2009
Springer
15 years 1 months ago
Discovering Influential Nodes for SIS Models in Social Networks
We address the problem of efficiently discovering the influential nodes in a social network under the susceptible/infected/susceptible (SIS) model, a diffusion model where nodes ar...
Kazumi Saito, Masahiro Kimura, Hiroshi Motoda
ATAL
2006
Springer
15 years 1 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara