Sciweavers

2095 search results - page 223 / 419
» Modeling and Querying Semi-structured Data
Sort
View
STOC
2012
ACM
272views Algorithms» more  STOC 2012»
13 years 9 months ago
The cell probe complexity of dynamic range counting
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
Kasper Green Larsen
SIGMOD
2007
ACM
144views Database» more  SIGMOD 2007»
16 years 6 months ago
The TopX DB&IR engine
This paper proposes a demo of the TopX search engine, an extensive framework for unified indexing, querying, and ranking of large collections of unstructured, semistructured, and ...
Martin Theobald, Ralf Schenkel, Gerhard Weikum
PRL
2008
97views more  PRL 2008»
15 years 6 months ago
Repairing self-confident active-transductive learners using systematic exploration
We consider an active learning game within a transductive learning model. A major problem with many active learning algorithms is that an unreliable current hypothesis can mislead...
Ron Begleiter, Ran El-Yaniv, Dmitry Pechyony
IJON
2007
131views more  IJON 2007»
15 years 6 months ago
Margin-based active learning for LVQ networks
In this article, we extend a local prototype-based learning model by active learning, which gives the learner the capability to select training samples and thereby increase speed a...
Frank-Michael Schleif, Barbara Hammer, Thomas Vill...
ICDE
2004
IEEE
137views Database» more  ICDE 2004»
16 years 7 months ago
Selectivity Estimation for XML Twigs
Twig queries represent the building blocks of declarative query languages over XML data. A twig query describes a complex traversal of the document graph and generates a set of el...
Neoklis Polyzotis, Minos N. Garofalakis, Yannis E....