Sciweavers

4698 search results - page 376 / 940
» Making Functionality More General
Sort
View
CIKM
2009
Springer
15 years 9 months ago
Heterogeneous cross domain ranking in latent space
Traditional ranking mainly focuses on one type of data source, and effective modeling still relies on a sufficiently large number of labeled or supervised examples. However, in m...
Bo Wang, Jie Tang, Wei Fan, Songcan Chen, Zi Yang,...
ICAC
2008
IEEE
15 years 11 months ago
Utility-Based Reinforcement Learning for Reactive Grids
—Large scale production grids are an important case for autonomic computing. They follow a mutualization paradigm: decision-making (human or automatic) is distributed and largely...
Julien Perez, Cécile Germain-Renaud, Bal&aa...
CRYPTO
2003
Springer
156views Cryptology» more  CRYPTO 2003»
15 years 10 months ago
Fast Algebraic Attacks on Stream Ciphers with Linear Feedback
Many popular stream ciphers apply a filter/combiner to the state of one or several LFSRs. Algebraic attacks on such ciphers [10, 11] are possible, if there is a multivariate relat...
Nicolas Courtois
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
16 years 5 months ago
Intrinsic robustness of the price of anarchy
The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...
Tim Roughgarden
ICCV
2005
IEEE
16 years 7 months ago
Improved Sub-pixel Stereo Correspondences through Symmetric Refinement
Most dense stereo correspondence algorithms start by establishing discrete pixel matches and later refine these matches to sub-pixel precision. Traditional sub-pixel refinement me...
Diego Nehab, Szymon Rusinkiewicz, James Davis