1403 search results - page 125 / 281 » About Approximations of Exponentials |
151
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....
132
click to vote
COCO
2009
Springer
15 years 11 months ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
135
click to vote
FC
2009
Springer
15 years 11 months ago
2009
Springer
We present a cryptographic protocol for conducting efficient, provably correct and secrecy-preserving combinatorial clock-proxy auctions. The “clock phase” functions as a trust...
160
Voted
MKM
2009
Springer
15 years 11 months ago
2009
Springer
Methods for deciding quantifier-free non-linear arithmetical conjectures over R are crucial in the formal verification of many realworld systems and in formalised mathematics. Wh...
141
Voted
HAPTICS
2008
IEEE
15 years 11 months ago
2008
IEEE
While standard closed haptic control loop used in haptic simulation of rigid bodies are bounded to low frequency force restitution, event-based or open-loop haptic, by superimposin...