Sciweavers

3341 search results - page 203 / 669
» On Bounded Queries and Approximation
Sort
View
CIE
2006
Springer
15 years 9 months ago
Lower Bounds Using Kolmogorov Complexity
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
Sophie Laplante
CCCG
2003
15 years 7 months ago
Computing the Closest Point to a Circle
In this paper we consider the problem of computing the closest point to the boundary of a circle among a set S of n points. We present two algorithms to solve this problem. One al...
Pinaki Mitra, Asish Mukhopadhyay, S. V. Rao
DEBU
2010
108views more  DEBU 2010»
15 years 5 months ago
Weighted Set-Based String Similarity
Consider a universe of tokens, each of which is associated with a weight, and a database consisting of strings that can be represented as subsets of these tokens. Given a query st...
Marios Hadjieleftheriou, Divesh Srivastava
GLOBECOM
2007
IEEE
16 years 4 days ago
Performance Analysis of V-BLAST with Optimum Power Allocation
—Comprehensive performance analysis of the unordered V-BLAST algorithm with various power allocation strategies is presented, which makes use of analytical tools and resorts to M...
Victoria Kostina, Sergey Loyka
162
Voted
TALG
2010
123views more  TALG 2010»
15 years 4 months ago
Lower-bounded facility location
We study the lower-bounded facility location problem, which generalizes the classical uncapacitated facility location problem in that it comes with lower bound constraints for the...
Zoya Svitkina