Sciweavers

2520 search results - page 199 / 504
» The complexity of approximating entropy
Sort
View
NIPS
2004
15 years 7 months ago
Efficient Kernel Machines Using the Improved Fast Gauss Transform
The computation and memory required for kernel machines with N training samples is at least O(N2 ). Such a complexity is significant even for moderate size problems and is prohibi...
Changjiang Yang, Ramani Duraiswami, Larry S. Davis
DLOG
2009
15 years 7 months ago
Which Kind of Module Should I Extract?
Abstract There are various techniques for specifying a module of an ontology that covers all knowledge about a given set of terms. These differ with respect to the size of the modu...
Ulrike Sattler, Thomas Schneider 0002, Michael Zak...
TSMC
2008
113views more  TSMC 2008»
15 years 5 months ago
Computational Methods for Verification of Stochastic Hybrid Systems
Stochastic hybrid system (SHS) models can be used to analyze and design complex embedded systems that operate in the presence of uncertainty and variability. Verification of reacha...
Xenofon D. Koutsoukos, Derek Riley
ICASSP
2011
IEEE
14 years 9 months ago
Polynomial expansion detector for uniform linear arrays
In this paper, we design a low complexity linear MMSE decoder to recover the signal transmitted by M mobile users to a base station equipped with N receiving antennas, arranged as...
Antonia Maria Masucci, Øyvind Ryan, M&eacut...
DAC
1996
ACM
15 years 10 months ago
A Sparse Image Method for BEM Capacitance Extraction
Boundary element methods (BEM) are often used for complex 3-D capacitance extraction because of their efficiency, ease of data preparation, and automatic handling of open regions. ...
Byron Krauter, Yu Xia, E. Aykut Dengi, Lawrence T....