5130 search results - page 999 / 1026 » Constraint Query Languages |
CHI
2003
ACM
16 years 2 months ago
2003
ACM
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...
123
Voted
STOC
2004
ACM
16 years 2 months ago
2004
ACM
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...
128
Voted
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
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...
171
Voted
PODS
2004
ACM
16 years 2 months ago
2004
ACM
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...
151
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
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, ...