104 search results - page 15 / 21 » Hierarchical Hardness Models for SAT |
ICCV
2011
IEEE
12 years 8 months ago
2011
IEEE
This paper addresses the challenge of recognizing behavior of groups of individuals in unconstraint surveillance environments. As opposed to approaches that rely on agglomerative ...
MOBIHOC
2007
ACM
14 years 8 months ago
2007
ACM
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout...
EVOW
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. This work describes an evolutionary approach to texture segmentation, a long-standing and important problem in computer vision. The difficulty of the problem can be relat...
ICCAD
2000
IEEE
14 years 26 days ago
2000
IEEE
This paper presents an efficient method for optimizing power/ground (P/G) networks by widening wires and adding decoupling capacitors (decaps). It proposes a structured skeleton t...
AAAI
1998
13 years 9 months ago
1998
This paperconsidersthe problem of representingcomplex systems that evolve stochastically over time. Dynamic Bayesian networks provide a compact representation for stochastic proce...