Sciweavers

740 search results - page 88 / 148
» FAST Extended Release
Sort
View
ICCAD
1999
IEEE
76views Hardware» more  ICCAD 1999»
14 years 2 months ago
Optimal allocation of carry-save-adders in arithmetic optimization
: Carry-save-adder(CSA) is one of the most widely used schemes for fast arithmetic in industry. This paper provides a solution to the problem of finding an optimal-timing allocatio...
Junhyung Um, Taewhan Kim, C. L. Liu
ACISP
1999
Springer
14 years 2 months ago
On the Symmetric Property of Homogeneous Boolean Functions
We use combinatorial methods and permutation groups to classify homogeneous boolean functions. The property of symmetry of a boolean function limits the size of the function’s cl...
Chengxin Qu, Jennifer Seberry, Josef Pieprzyk
AI
1998
Springer
14 years 2 months ago
Temporally Invariant Junction Tree for Inference in Dynamic Bayesian Network
Abstract. Dynamic Bayesian networks (DBNs) extend Bayesian networks from static domains to dynamic domains. The only known generic method for exact inference in DBNs is based on dy...
Yang Xiang
VLDB
1990
ACM
118views Database» more  VLDB 1990»
14 years 2 months ago
Distributed Linear Hashing and Parallel Projection in Main Memory Databases
This paper extends the conceptsof the distributed linear hashedmain memory file system with the objective of supportinghigher level parallel dambaseoperations. The basicdistribute...
Charles Severance, Sakti Pramanik, P. Wolberg
ECML
2006
Springer
13 years 12 months ago
Efficient Large Scale Linear Programming Support Vector Machines
This paper presents a decomposition method for efficiently constructing 1-norm Support Vector Machines (SVMs). The decomposition algorithm introduced in this paper possesses many d...
Suvrit Sra