1090 search results - page 186 / 218 » The Equivalence between Biology and Computation |
113
click to vote
INFOCOM
2011
IEEE
14 years 3 months ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
123
click to vote
COCO
2009
Springer
15 years 6 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
100
click to vote
SIGLEX
1991
15 years 3 months ago
1991
This paper argues for a two-level theory of semantics as opposed to a one-level theory, based on the example of the system of temporal and durationM connectives. Instead of identi...
126
click to vote
JMLR
2012
13 years 2 months ago
2012
Metric and kernel learning arise in several machine learning applications. However, most existing metric learning algorithms are limited to learning metrics over low-dimensional d...
COCO
2010
Springer
15 years 3 months ago
2010
Springer
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...