5606 search results - page 771 / 1122 » Randomization Techniques for Graphs. |
146
click to vote
ICDM
2003
IEEE
16 years 2 days ago
2003
IEEE
In knowledge discovery applications, where new features are to be added, an acquisition policy can help select the features to be acquired based on their relevance and the cost of...
177
click to vote
ITC
2003
IEEE
16 years 1 days ago
2003
IEEE
This paper describes a Hybrid DFT (H-DFT) architecture for low-cost, high quality structural testing in the high volume manufacturing (HVM) environment. This structure efficiently...
167
click to vote
ANSS
2002
IEEE
15 years 11 months ago
2002
IEEE
Statistical simulation is driven by a stream of randomly generated instructions, based on statistics collected during a single detailed simulation. This method can give accurate p...
166
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We prove a quasi-polynomial lower bound on the size of bounded-depth Frege proofs of the pigeonhole principle PHPm n where m ´1 · 1 polylog nµn. This lower bound qualitatively ...
195
click to vote
FUN
2010
Springer
15 years 11 months ago
2010
Springer
We propose a model for level-ups in Heroes of Might and Magic III, and give an O 1 ε2 ln 1 δ learning algorithm to estimate the probabilities of secondary skills induced by any ...