Sciweavers

2745 search results - page 99 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
138
Voted
SIGECOM
2003
ACM
135views ECommerce» more  SIGECOM 2003»
15 years 9 months ago
Playing large games using simple strategies
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
Richard J. Lipton, Evangelos Markakis, Aranyak Meh...
160
Voted
GRID
2006
Springer
15 years 3 months ago
YA: Fast and Scalable Discovery of Idle CPUs in a P2P network
Discovery of large amounts of idle CPUs in fully distributed and shared Grid systems is needed in relevant applications and is still a challenging problem. In this paper we present...
Javier Celaya, Unai Arronategui
142
Voted
IPPS
2003
IEEE
15 years 9 months ago
Fast Online Task Placement on FPGAs: Free Space Partitioning and 2D-Hashing
Partial reconfiguration allows for mapping and executing several tasks on an FPGA during runtime. Multitasking on FPGAs raises a number of questions on the management of the reco...
Herbert Walder, Christoph Steiger, Marco Platzner
ICCV
2007
IEEE
15 years 10 months ago
Fast Matching of Planar Shapes in Sub-cubic Runtime
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
Frank R. Schmidt, Dirk Farin, Daniel Cremers
ICCV
2011
IEEE
14 years 3 months ago
Fast Removal of Non-uniform Camera Shake
Camera shake leads to non-uniform image blurs. Stateof-the-art methods for removing camera shake model the blur as a linear combination of homographically transformed versions of ...
Michael Hirsch, Christian Schuler, Stefan Harmelin...