Sciweavers

2539 search results - page 113 / 508
» Updates for Structure Indexes
Sort
View
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
15 years 9 months ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld
SIGIR
2006
ACM
15 years 10 months ago
Type less, find more: fast autocompletion search with a succinct index
We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant d...
Holger Bast, Ingmar Weber
ESOP
2008
Springer
15 years 6 months ago
Semi-persistent Data Structures
A data structure is said to be persistent when any update operation returns a new structure without altering the old version. This paper introduces a new notion of persistence, cal...
Sylvain Conchon, Jean-Christophe Filliâtre
IDEAS
2005
IEEE
113views Database» more  IDEAS 2005»
15 years 10 months ago
On the Intersection of XPath Expressions
— XPath is a common language for selecting nodes in an XML document. XPath uses so called path expressions which describe a navigation path through semistructured data. In the la...
Beda Christoph Hammerschmidt, Martin Kempa, Volker...
ACL
1994
15 years 5 months ago
Multiset-Valued Linear Index Grammars: Imposing Dominance Constraints on Derivations
This paper defines multiset-valued linear index grammar and unordered vector grammar with dominance links. The former models certain uses of multisetvalued feature structures in u...
Owen Rambow