2173 search results - page 143 / 435 » On the Values of Reducibility Candidates |
ICML
2008
IEEE
15 years 11 months ago
2008
IEEE
We describe an algorithm for learning in the presence of multiple criteria. Our technique generalizes previous approaches in that it can learn optimal policies for all linear pref...
173
click to vote
VLDB
2007
ACM
15 years 10 months ago
2007
ACM
In this paper we study the trade-offs between time series compressibility and partial information hiding and their fundamental implications on how we should introduce uncertainty ...
ICCD
2006
IEEE
15 years 7 months ago
2006
IEEE
—X-filling is preferred for low-capture-power scan test generation, since it reduces IR-drop-induced yield loss without the need of any circuit modification. However, the effecti...
91
Voted
CAV
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we consider two-player zero-sum payoff games on finite graphs, both in the deterministic as well as in the stochastic setting. In the deterministic setting, we consi...
103
click to vote
IEEEICCI
2009
IEEE
15 years 4 months ago
2009
IEEE
In practical issues, categorical data and numerical data usually coexist, and a unified data reduction technique for hybrid data is desirable. In this paper, an information measu...