1299 search results - page 245 / 260 » Computing Minimal Diagnoses with Critical Set Algorithms |
112
click to vote
DAC
2007
ACM
15 years 10 months ago
2007
ACM
This paper argues for an implicitly parallel programming model for many-core microprocessors, and provides initial technical approaches towards this goal. In an implicitly paralle...
107
click to vote
ATAL
2005
Springer
15 years 3 months ago
2005
Springer
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
MOBICOM
2004
ACM
15 years 3 months ago
2004
ACM
Wireless IEEE 802.11 networks in residences, small businesses, and public “hot spots” typically encounter the wireline access link (DSL, cable modem, T1, etc.) as the slowest ...
103
Voted
ASPDAC
2001
ACM
15 years 1 months ago
2001
ACM
Abstract-- We describe new graph bipartization algorithms for layout modification and phase assignment of bright-field alternating phaseshifting masks (AltPSM) [25]. The problem of...
105
click to vote
ICCV
2005
IEEE
15 years 11 months ago
2005
IEEE
In recent years Kernel Principal Component Analysis (Kernel PCA) has gained much attention because of its ability to capture nonlinear image features, which are particularly impor...