Sciweavers

18572 search results - page 913 / 3715
» High performance C
Sort
View
CIE
2010
Springer
16 years 15 days ago
Circuit Complexity and Multiplicative Complexity of Boolean Functions
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...
Arist Kojevnikov, Alexander S. Kulikov
ECOOPW
1998
Springer
15 years 12 months ago
Assessing Aspect-Oriented Programming: Preliminary Results
The aspect-oriented programming approach claims to make it easier to reason about, develop, and maintain certain kinds of application code while maintaining highly e cient code. To...
Robert J. Walker, Elisa L. A. Baniassad, Gail C. M...
178
Voted
DEBS
2008
ACM
15 years 9 months ago
BFSiena: a communication substrate for StreamMine
StreamMine is a scalable middleware for massive real-time data streaming. In this paper we present the BFSiena: a communication substrate for the StreamMine. BFSiena is a content-...
Zbigniew Jerzak, Christof Fetzer
SDM
2004
SIAM
123views Data Mining» more  SDM 2004»
15 years 9 months ago
Nonlinear Manifold Learning for Data Stream
There has been a renewed interest in understanding the structure of high dimensional data set based on manifold learning. Examples include ISOMAP [25], LLE [20] and Laplacian Eige...
Martin H. C. Law, Nan Zhang 0002, Anil K. Jain
FTCS
1998
84views more  FTCS 1998»
15 years 9 months ago
On the Use of Formal Techniques for Validation
The traditional use of formal methods has been for the veri cation of algorithms or protocols. Given the high cost and limitations in state space coverage provided by conventional...
Neeraj Suri, Purnendu Sinha