4110 search results - page 389 / 822 » Efficient algorithms for the 2-gathering problem |
180
click to vote
AAECC
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. After some excitement generated by recently suggested public key exchange protocols due to Anshel-Anshel-Goldfeld and Ko-Lee et al., it is a prevalent opinion now that th...
192
click to vote
JMLR
2008
15 years 6 months ago
2008
We show that the relevant information of a supervised learning problem is contained up to negligible error in a finite number of leading kernel PCA components if the kernel matche...
166
click to vote
MP
2008
15 years 6 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
175
click to vote
CAD
2000
Springer
15 years 6 months ago
2000
Springer
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...
178
click to vote
SIGSOFT
2010
ACM
15 years 4 months ago
2010
ACM
Concurrent programs are notoriously difficult to debug. We see two main reasons for this: 1) concurrency bugs are often difficult to reproduce, 2) traces of buggy concurrent execu...