Sciweavers

5153 search results - page 486 / 1031
» Introduction to Randomized Algorithms
Sort
View
IVEVA
2004
15 years 7 months ago
Groups and Crowds with behaviors specified in the environment
Abstract. In this paper we describe a system where behavior of characters and groups of characters are determined by assigning attributes to groups and individuals hierarchically a...
Isaac Rudomín, Fernando Perez, Erik Mill&aa...
124
Voted
CORR
2010
Springer
98views Education» more  CORR 2010»
15 years 6 months ago
Efficient Sketches for the Set Query Problem
We develop an algorithm for estimating the values of a vector x Rn over a support S of size k from a randomized sparse binary linear sketch Ax of size O(k). Given Ax and S, we ca...
Eric Price
CORR
2008
Springer
115views Education» more  CORR 2008»
15 years 6 months ago
Kolmogorov complexity in perspective
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: rand...
Marie Ferbus-Zanda, Serge Grigorieff
CORR
2008
Springer
115views Education» more  CORR 2008»
15 years 6 months ago
Approximating Multi-Criteria Max-TSP
Abstract. We present randomized approximation algorithms for multicriteria Max-TSP. For Max-STSP with k > 1 objective functions, we obtain an approximation ratio of 1 k - for a...
Markus Bläser, Bodo Manthey, Oliver Putz
CORR
2007
Springer
94views Education» more  CORR 2007»
15 years 6 months ago
Neighbor Discovery in Wireless Networks:A Multiuser-Detection Approach
— We examine the problem of determining which nodes are neighbors of a given one in a wireless network. We consider an unsupervised network operating on a frequencyflat Gaussian...
Daniele Angelosante, Ezio Biglieri, Marco Lops