Sciweavers

5130 search results - page 999 / 1026
» Constraint Query Languages
Sort
View
CHI
2003
ACM
14 years 11 months ago
Leaders leading? a shift in technology adoption
In the past, most early hands-on users of interactive software in organizations were individual contributors. Managers as early adopters is a new trend with significant implicatio...
Jonathan Grudin
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 11 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
ICALP
2009
Springer
14 years 11 months ago
Dynamic Succinct Ordered Trees
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
Arash Farzan, J. Ian Munro
PODS
2004
ACM
158views Database» more  PODS 2004»
14 years 11 months ago
Composing Schema Mappings: Second-Order Dependencies to the Rescue
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...
Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wa...
SODA
2010
ACM
213views Algorithms» more  SODA 2010»
14 years 8 months ago
Regular Expression Matching with Multi-Strings
Regular expression matching is a key task (and often computational bottleneck) in a variety of software tools and applications. For instance, the standard grep and sed utilities, ...
Philip Bille, Mikkel Thorup