2127 search results - page 50 / 426 » Computing large matchings fast |
172
click to vote
DATE
2000
IEEE
15 years 10 months ago
2000
IEEE
In [1], Murata et al introduced an elegant representation of block placement called sequence pair. All block placement algorithms which are based on sequence pairs use simulated a...
160
click to vote
ICDM
2010
IEEE
15 years 3 months ago
2010
IEEE
Given a large graph, like a computer network, which k nodes should we immunize (or monitor, or remove), to make it as robust as possible against a computer virus attack? We need (...
163
click to vote
CVPR
2004
IEEE
16 years 7 months ago
2004
IEEE
Traditionally, the problem of stereo matching has been addressed either by a local window-based approach or a dense pixel-based approach using global optimization. In this paper, ...
178
Voted
ICCAD
2003
IEEE
15 years 11 months ago
2003
IEEE
: This paper presents FROSTY, a computer program for automatically extracting the hierarchy of a large-scale digital CMOS circuit from its transistor-level netlist description and ...
151
Voted
ICCV
2005
IEEE
15 years 11 months ago
2005
IEEE
Abstract. Accurate head tilt detection has a large potential to aid people with disabilities in the use of human-computer interfaces and provide universal access to communication s...