Sciweavers

3319 search results - page 274 / 664
» Type Theoretical Databases
Sort
View
ICDT
2010
ACM
180views Database» more  ICDT 2010»
16 years 20 days ago
Foundations of SPARQL Query Optimization
We study fundamental aspects related to the efficient processing of the SPARQL query language for RDF, proposed by the W3C to encode machine-readable information in the Semantic W...
Michael Schmidt, Michael Meier, Georg Lausen
136
Voted
ICASSP
2009
IEEE
15 years 10 months ago
Posterior features applied to speech recognition tasks with user-defined vocabulary
This paper presents a novel approach for those applications where vocabulary is defined by a set of acoustic samples. In this approach, the acoustic samples are used as reference...
Guillermo Aradilla, Hervé Bourlard, Mathew ...
CIKM
2009
Springer
15 years 9 months ago
Fragment-based clustering ensembles
Clustering ensembles combine different clustering solutions into a single robust and stable one. Most of existing methods become highly time-consuming when the data size turns to ...
Ou Wu, Mingliang Zhu, Weiming Hu
CIKM
2009
Springer
15 years 9 months ago
AS-index: a structure for string search using n-grams and algebraic signatures
AS-Index is a new index structure for exact string search in disk resident databases. It uses hashing, unlike known alternate structures, tree or trie based, and indexes every n-g...
Cédric du Mouza, Witold Litwin, Philippe Ri...
ICALP
2005
Springer
15 years 8 months ago
The Tree Inclusion Problem: In Optimal Space and Faster
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
Philip Bille, Inge Li Gørtz