9842 search results - page 311 / 1969 » The Complexity of the Matching-Cut Problem |
138
Voted
NPL
2002
15 years 3 months ago
2002
The learning of complex relationships can be decomposed into several neural networks. The modular organization is determined by prior knowledge of the problem that permits to split...
133
Voted
TCS
2010
14 years 10 months ago
2010
We describe a solution to the SAT problem via non-confluent P systems with active membranes, without using membrane division rules. Furthermore, we provide an algorithm for simula...
139
click to vote
ICIP
2008
IEEE
16 years 5 months ago
2008
IEEE
The allowable computational complexity of video encoding is limited in a power-constrained system. Different video frames are associated with different motions and contexts, and s...
146
Voted
SAC
2005
ACM
15 years 9 months ago
2005
ACM
Many biological information systems rely on relational database management systems (RDBMS) to manage high-throughput biological data. While keeping these data well archived, organ...
132
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...