11345 search results - page 1800 / 2269 » Foundations of Computer Science |
149
click to vote
STACS
2010
Springer
15 years 12 months ago
2010
Springer
Let (V, δ) be a finite metric space, where V is a set of n points and δ is a distance function defined for these points. Assume that (V, δ) has a constant doubling dimension d...
137
click to vote
STACS
2010
Springer
15 years 12 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
146
click to vote
ACSC
2009
IEEE
15 years 11 months ago
2009
IEEE
Most text mining methods are based on representing documents using a vector space model, commonly known as a bag of word model, where each document is modeled as a linear vector r...
142
click to vote
STOC
2009
ACM
15 years 11 months ago
2009
ACM
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...
141
Voted
STACS
2009
Springer
15 years 11 months ago
2009
Springer
We analyze the structure of equilibria and the price of anarchy in the family of network creation games considered extensively in the past few years, which attempt to unify the net...