1333 search results - page 132 / 267 » Not a Number of Floating Point Problems |
131
Voted
SIAMCOMP
2008
15 years 3 months ago
2008
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
122
click to vote
SIAMSC
2008
15 years 3 months ago
2008
Abstract. We present a new derivative-free algorithm, ORBIT, for unconstrained local optimization of computationally expensive functions. A trust-region framework using interpolati...
115
click to vote
CN
2004
15 years 3 months ago
2004
We consider the problem of locating nearby application peers over the Internet. We define a new peer-location scheme (called Tiers), that scales to large application peer groups. ...
129
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
133
click to vote
ASIACRYPT
2006
Springer
15 years 7 months ago
2006
Springer
There have been active discussions on how to derive a consistent cryptographic key from noisy data such as biometric templates, with the help of some extra information called a ske...