Sciweavers

831 search results - page 17 / 167
» Finding Minimum Data Requirements Using Pseudo-independence
Sort
View
DAC
2007
ACM
14 years 8 months ago
Optimization of Area in Digital FIR Filters using Gate-Level Metrics
In the paper, we propose a new metric for the minimization of area in the generic problem of multiple constant multiplications, and demonstrate its effectiveness for digital FIR f...
Eduardo A. C. da Costa, José C. Monteiro, L...
AUSAI
2008
Springer
13 years 9 months ago
Learning to Find Relevant Biological Articles without Negative Training Examples
Classifiers are traditionally learned using sets of positive and negative training examples. However, often a classifier is required, but for training only an incomplete set of pos...
Keith Noto, Milton H. Saier Jr., Charles Elkan
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
14 years 8 months ago
A fast algorithm for finding frequent episodes in event streams
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan
MOBIHOC
2002
ACM
14 years 7 months ago
Minimum energy paths for reliable communication in multi-hop wireless networks
Current algorithms for minimum-energy routing in wireless networks typically select minimum-cost multi-hop paths. In scenarios where the transmission power is fixed, each link has...
Suman Banerjee, Archan Misra
FLAIRS
2004
13 years 9 months ago
Finding Partners to Form Information Sharing Networks in Open Multi-Agent Systems
Information quality assurance despite the existence of uncertainty about sources can be investigated in the context of soft security where an agent maintains trustworthiness evalu...
K. Suzanne Barber, Jisun Park