Sciweavers

4850 search results - page 238 / 970
» Approximate Data Structures with Applications
Sort
View
ISW
2001
Springer
15 years 11 months ago
Persistent Authenticated Dictionaries and Their Applications
Abstract. We introduce the notion of persistent authenticated dictionaries, that is, dictionaries where the user can make queries of the type “was element e in set S at time t?â€...
Aris Anagnostopoulos, Michael T. Goodrich, Roberto...
ISAAC
2007
Springer
109views Algorithms» more  ISAAC 2007»
16 years 20 days ago
Separating Populations with Wide Data: A Spectral Analysis
In this paper, we consider the problem of partitioning a small data sample drawn from a mixture of k product distributions. We are interested in the case that individual features a...
Avrim Blum, Amin Coja-Oghlan, Alan M. Frieze, Shuh...
ICDE
2002
IEEE
91views Database» more  ICDE 2002»
15 years 11 months ago
Lossy Reduction for Very High Dimensional Data
We consider the use of data reduction techniques for the problem of approximate query answering. We focus on applications for which accurate answers to selective queries are requi...
Chris Jermaine, Edward Omiecinski
IJON
2008
98views more  IJON 2008»
15 years 6 months ago
Factorisation and denoising of 0-1 data: A variational approach
Presence-absence (0-1) observations are special in that often the absence of evidence is not evidence of absence. Here we develop an independent factor model, which has the unique...
Ata Kabán, Ella Bingham
FUIN
2010
106views more  FUIN 2010»
15 years 3 months ago
Horn Knowledge Bases in Regular Description Logics with PTIME Data Complexity
Abstract. Developing a good formalism and an efficient decision procedure for the instance checking problem is desirable for practical application of description logics. The data c...
Linh Anh Nguyen