185 search results - page 12 / 37 » Constructions of Grassmannian Simplices |
94
Voted
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
110
click to vote
WWW
2002
ACM
14 years 9 months ago
2002
ACM
In this paper we present a graphical query language for XML. The language, based on a simple form of graph grammars, permits us to extract data and reorganize information in a new...
SPAA
2003
ACM
15 years 3 months ago
2003
ACM
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
COCOON
2010
Springer
15 years 2 months ago
2010
Springer
The persistent homology provides a mathematical tool to describe “features” in a principled manner. The persistence algorithm proposed by Edelsbrunner et al. [9] can compute n...
73
Voted
UAI
2000
14 years 11 months ago
2000
The K-Means and EM algorithms are popular in clustering and mixture modeling due to their simplicity and ease of implementation. However, they have several significant limitations...