4377 search results - page 260 / 876 » Mass problems and randomness |
188
click to vote
PREMI
2005
Springer
16 years 5 days ago
2005
Springer
In the typical nonparametric approach to classification in instance-based learning and data mining, random data (the training set of patterns) are collected and used to design a d...
168
click to vote
CRYPTO
2000
Springer
15 years 11 months ago
2000
Springer
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...
182
click to vote
CN
2010
15 years 6 months ago
2010
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...
179
click to vote
TOC
2008
15 years 6 months ago
2008
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
192
click to vote
TSP
2008
15 years 6 months ago
2008
Consider a downlink multicast scenario where a base station equipped with multiple antennas wishes to simultaneously broadcast a number of signals to some given groups of users ove...