2342 search results - page 65 / 469 » Sublinear geometric algorithms |
137
Voted
WADS
2007
Springer
15 years 8 months ago
2007
Springer
We introduce a family of directed geometric graphs, denoted Gθ λ, that depend on two parameters λ and θ. For 0 ≤ θ < π 2 and 1 2 < λ < 1, the Gθ λ graph is a s...
120
click to vote
SCCC
2005
IEEE
15 years 8 months ago
2005
IEEE
— Fuzzy clustering methods have been widely used in many applications. These methods, including fuzzy k-means and Expectation Maximization, allow an object to be assigned to mult...
116
Voted
WAW
2004
Springer
15 years 7 months ago
2004
Springer
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...
97
Voted
AAECC
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. Let C be an algebraic geometric code of dimension k and length n constructed on a curve X over Fq. Let s(C) be the state complexity of C and set w(C) := min{k, n-k}, the ...
132
click to vote
FOCS
2003
IEEE
15 years 7 months ago
2003
IEEE
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...