6618 search results - page 1280 / 1324 » Natural Logic for Natural Language |
182
click to vote
RECOMB
2008
Springer
16 years 4 days ago
2008
Springer
The transcriptional regulatory sequences in metazoan genomes often consist of multiple cis-regulatory modules (CRMs). Each CRM contains locally enriched occurrences of binding site...
STOC
2004
ACM
16 years 3 days 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...
ICALP
2009
Springer
16 years 3 days ago
2009
Springer
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...
ICALP
2009
Springer
16 years 3 days ago
2009
Springer
We initiate the study of sublinear-time algorithms in the external memory model [14]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged...
105
click to vote
SIGMOD
2002
ACM
15 years 12 months ago
2002
ACM
The widespread distribution and availability of smallscale sensors, actuators, and embedded processors is transforming the physical world into a computing platform. One such examp...