Sciweavers

983 search results - page 78 / 197
» Circuit Complexity and Multiplicative Complexity of Boolean ...
Sort
View
VLDB
1992
ACM
116views Database» more  VLDB 1992»
14 years 2 months ago
Supporting Lists in a Data Model (A Timely Approach)
This paper considers the problem of adding list as a type constructor to an object-oriented data model. In particular, we are concerned with how lists in a database can be constru...
Joel E. Richardson
NC
2011
201views Neural Networks» more  NC 2011»
13 years 5 months ago
The computational power of membrane systems under tight uniformity conditions
We apply techniques from complexity theory to a model of biological cellular membranes known as membrane systems or P-systems. Like Boolean circuits, membrane systems are defined ...
Niall Murphy, Damien Woods
JMLR
2002
89views more  JMLR 2002»
13 years 10 months ago
The Set Covering Machine
We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the...
Mario Marchand, John Shawe-Taylor
VTC
2007
IEEE
101views Communications» more  VTC 2007»
14 years 4 months ago
Multi-Functional Antenna Array Assisted MC DS-CDMA Using Downlink Preprocessing Based on Singular Value Decomposition
—In this contribution we propose and investigate a transmitter preprocessing scheme designed for downlink transmission in multicarrier direct-sequence code-division multiple-acce...
Chong Xu, Bin Hu, Lie-Liang Yang, Lajos Hanzo
ISMB
1994
13 years 11 months ago
An Efficient Method for Multiple Sequence Alignment
Multiple sequence alignment has been a useful methodin the study of molecular evolution and sequence-structure relationships. This paper presents a newmethodfor multiple sequence ...
Jin Kim, Sakti Pramanik