2127 search results - page 78 / 426 » Computing large matchings fast |
178
Voted
DAC
2006
ACM
16 years 4 months ago
2006
ACM
- Classical two-variable symmetries play an important role in many EDA applications, ranging from logic synthesis to formal verification. This paper proposes a complete circuit-bas...
134
Voted
AINA
2006
IEEE
15 years 9 months ago
2006
IEEE
Ternary content-addressable memories (TCAMs) have gained wide acceptance in the industry for storing and searching patterns in routers. But two important problems block the way to...
142
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
132
click to vote
DSOM
2003
Springer
15 years 8 months ago
2003
Springer
Building self-maintained overlay networks for message routing has recently attracted significant research interest [5–9]. All suggested solutions have a common goal: To build an...
158
Voted
ICIP
2009
IEEE
16 years 4 months ago
2009
IEEE
We consider the problem of head tracking and pose estimation in realtime from low resolution images. Tracking and pose recognition are treated as two coupled problems in a probabi...