Sciweavers

1224 search results - page 149 / 245
» Theory decision by decomposition
Sort
View
DCC
2005
IEEE
16 years 6 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said
ICASSP
2008
IEEE
16 years 26 days ago
Impact of mismatched statistics on correlated MIMO capacity
Many recent works that study the impact of spatial correlation on the performance of multi-input multi-output (MIMO) systems assume a separable (also known as the Kronecker) model...
Vasanthan Raghavan, Akbar M. Sayeed, Jayesh H. Kot...
ECML
2007
Springer
16 years 17 days ago
Scale-Space Based Weak Regressors for Boosting
Boosting is a simple yet powerful modeling technique that is used in many machine learning and data mining related applications. In this paper, we propose a novel scale-space based...
Jin Hyeong Park, Chandan K. Reddy
EMSOFT
2007
Springer
16 years 17 days ago
The algebra of connectors: structuring interaction in BIP
We provide an algebraic formalisation of connectors in BIP. These are used to structure interactions in a component-based system. A connector relates a set of typed ports. Types a...
Simon Bliudze, Joseph Sifakis
FOCS
2006
IEEE
16 years 14 days ago
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
Tamás Király, Lap Chi Lau