Sciweavers

1055 search results - page 84 / 211
» Enumerations in computable structure theory
Sort
View
ICDE
2005
IEEE
144views Database» more  ICDE 2005»
15 years 11 months ago
ViteX: A Streaming XPath Processing System
We present ViteX, an XPath processing system on XML streams with polynomial time complexity. ViteX uses a polynomial-space data structure to encode an exponential number of patter...
Yi Chen, Susan B. Davidson, Yifeng Zheng
SPAA
2003
ACM
15 years 3 months ago
The effect of communication costs in solid-state quantum computing architectures
Quantum computation has become an intriguing technology with which to attack difficult problems and to enhance system security. Quantum algorithms, however, have been analyzed un...
Dean Copsey, Mark Oskin, Tzvetan S. Metodi, Freder...
NIPS
2008
14 years 11 months ago
Goal-directed decision making in prefrontal cortex: a computational framework
Research in animal learning and behavioral neuroscience has distinguished between two forms of action control: a habit-based form, which relies on stored action values, and a goal...
Matthew Botvinick, James An
PODS
2006
ACM
137views Database» more  PODS 2006»
15 years 10 months ago
Data exchange: computing cores in polynomial time
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...
Georg Gottlob, Alan Nash
BMCBI
2008
128views more  BMCBI 2008»
14 years 10 months ago
Efficient computation of absent words in genomic sequences
Background: Analysis of sequence composition is a routine task in genome research. Organisms are characterized by their base composition, dinucleotide relative abundance, codon us...
Julia Herold, Stefan Kurtz, Robert Giegerich