Sciweavers

1031 search results - page 120 / 207
» Indexing Information for Data Forensics
Sort
View
ENTCS
2008
116views more  ENTCS 2008»
15 years 5 months ago
Phil: A Lazy Implementation of a Language for Approximate Filtering of XML Documents
In this paper, we introduce a system, written in Haskell, for filtering information from XML data. Essentially, the system implements a simple declarative language which allows on...
Michele Baggi, Demis Ballis
CG
2011
Springer
14 years 9 months ago
IA*: An adjacency-based representation for non-manifold simplicial shapes in arbitrary dimensions
We propose a compact, dimension-independent data structure for manifold, non-manifold and non-regular simplicial complexes, that we call the Generalized Indexed Data structure wit...
David Canino, Leila De Floriani, Kenneth Weiss
ITCC
2005
IEEE
15 years 11 months ago
NIPPERS: Network of InterPolated PeERS for Web Service Discovery
Web services are becoming an important enabler of the Semantic Web. Besides the need for a rich description mechanism, Web Service information should be made available in an acces...
Christos Makris, Evangelos Sakkopoulos, Spyros Sio...
CIKM
2003
Springer
15 years 10 months ago
Dimensionality reduction using magnitude and shape approximations
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...
Ümit Y. Ogras, Hakan Ferhatosmanoglu
CIKM
2009
Springer
15 years 9 months ago
Classification-based resource selection
In some retrieval situations, a system must search across multiple collections. This task, referred to as federated search, occurs for example when searching a distributed index o...
Jaime Arguello, Jamie Callan, Fernando Diaz