Sciweavers

2957 search results - page 342 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
ALENEX
2010
117views Algorithms» more  ALENEX 2010»
15 years 8 months ago
Untangling the Braid: Finding Outliers in a Set of Streams
Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to trac...
Chiranjeeb Buragohain, Luca Foschini, Subhash Suri
NIPS
2007
15 years 8 months ago
Anytime Induction of Cost-sensitive Trees
Machine learning techniques are increasingly being used to produce a wide-range of classifiers for complex real-world applications that involve nonuniform testing costs and miscl...
Saher Esmeir, Shaul Markovitch
SIP
2003
15 years 8 months ago
Design of Full Band IIR Digital Differentiators
This paper presents an efficient method for designing full band IIR digital differentiators in the complex Chebyshev sense. The proposed method is based on the formulation of a g...
Xi Zhang, Toshinori Yoshikawa
IJCAI
1997
15 years 8 months ago
Extracting Propositions from Trained Neural Networks
This paper presents an algorithm for extract­ ing propositions from trained neural networks. The algorithm is a decompositional approach which can be applied to any neural networ...
Hiroshi Tsukimoto
DSP
2006
15 years 6 months ago
Matrix pencil method for simultaneously estimating azimuth and elevation angles of arrival along with the frequency of the incom
In this paper we describe a method for simultaneously estimating the direction of arrival (DOA) of the signal along with its unknown frequency. In a typical DOA estimation problem...
Nuri Yilmazer, Raul Fernandez-Recio, Tapan K. Sark...