6568 search results - page 1130 / 1314 » Reducing the Complexity of Reductions |
169
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Markov logic networks (MLNs) use firstorder formulas to define features of Markov networks. Current MLN structure learners can only learn short clauses (4-5 literals) due to extre...
185
click to vote
ECRTS
2010
IEEE
15 years 6 months ago
2010
IEEE
—In distributed real-time embedded systems (DRE), it is common to model an application as a set of task chains. Each chain is activated cyclically and must complete before an end...
183
click to vote
SMA
2010
ACM
15 years 6 months ago
2010
ACM
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
180
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
Currently, most of the watermarking algorithms for H.264/AVC video coding standard are encoder-based due to their high perceptual quality. However, for the compressed video, they ...
174
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
Recently, the Sparse Matrix Transform (SMT) has been proposed as a tool for estimating the eigen-decomposition of high dimensional data vectors [1]. The SMT approach has two major...