Sciweavers

1002 search results - page 144 / 201
» Towards Graph Programs for Graph Algorithms
Sort
View
117
Voted
CORR
2007
Springer
147views Education» more  CORR 2007»
15 years 2 months ago
Decomposition During Search for Propagation-Based Constraint Solvers
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
Martin Mann, Guido Tack, Sebastian Will
DAM
2002
135views more  DAM 2002»
15 years 2 months ago
Matchings in colored bipartite networks
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
Tongnyoul Yi, Katta G. Murty, Cosimo Spera
ISLPED
2009
ACM
125views Hardware» more  ISLPED 2009»
15 years 9 months ago
Behavior-level observability don't-cares and application to low-power behavioral synthesis
Many techniques for power management employed in advanced RTL synthesis tools rely explicitly or implicitly on observability don’t-care (ODC) conditions. In this paper we presen...
Jason Cong, Bin Liu, Zhiru Zhang
CVIU
2007
112views more  CVIU 2007»
15 years 2 months ago
Pedestrian detection and tracking in infrared imagery using shape and appearance
In this paper, we present an approach toward pedestrian detection and tracking from infrared imagery using joint shape and appearance cues. A layered representation is first intr...
Congxia Dai, Yunfei Zheng, Xin Li
MONET
2006
107views more  MONET 2006»
15 years 2 months ago
Utilization and fairness in spectrum assignment for opportunistic spectrum access
The Open Spectrum approach to spectrum access can achieve near-optimal utilization by allowing devices to sense and utilize available spectrum opportunistically. However, a naive d...
Chunyi Peng, Haitao Zheng, Ben Y. Zhao