Sciweavers

1806 search results - page 342 / 362
» Randomness and halting probabilities
Sort
View
SIGMETRICS
2010
ACM
213views Hardware» more  SIGMETRICS 2010»
14 years 2 months ago
Small subset queries and bloom filters using ternary associative memories, with applications
Associative memories offer high levels of parallelism in matching a query against stored entries. We design and analyze an architecture which uses a single lookup into a Ternary C...
Ashish Goel, Pankaj Gupta
FUN
2010
Springer
233views Algorithms» more  FUN 2010»
14 years 2 months ago
The Complexity of Flood Filling Games
We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n×n board of tiles where each tile is allocated one of ...
David Arthur, Raphaël Clifford, Markus Jalsen...

Publication
322views
14 years 2 months ago
Three-dimensional point cloud recognition via distributions of geometric distances
Ageometric framework for the recognition of three-dimensional objects represented by point clouds is introducedin this paper. The proposed approach is based on comparing distribut...
Mona Mahmoudi, Guillermo Sapiro
INFOCOM
2000
IEEE
14 years 2 months ago
Broadcast Disks with Polynomial Cost Functions
— In broadcast disk systems, information is broadcasted in a shared medium. When a client needs an item from the disk, it waits until that item is broadcasted. The fundamental al...
Amotz Bar-Noy, Boaz Patt-Shamir, Igor Ziper
CRYPTO
2000
Springer
149views Cryptology» more  CRYPTO 2000»
14 years 2 months ago
A Cryptographic Solution to a Game Theoretic Problem
In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for...
Yevgeniy Dodis, Shai Halevi, Tal Rabin