3134 search results - page 222 / 627 » Computing full disjunctions |
123
Voted
JMLR
2010
14 years 10 months ago
2010
Some online algorithms for linear classification model the uncertainty in their weights over the course of learning. Modeling the full covariance structure of the weights can prov...
99
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
This paper proposes an ultra low energy FFT processor suitable for sensor applications. The processor is based on R4MDC but achieves full utilization of computational elements. It...
145
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
The maximization of a positive (semi)definite complex quadratic form over a finite alphabet is NP-hard and achieved through exhaustive search when the form has full rank. Howeve...
163
Voted
DLOG
2011
2011
Reasoning in Resource-Constrained Environments: a Matchmaking Engine over Relational Knowledge Bases
14 years 7 months ago
We present a framework for logic-based matchmaking on ALN ABoxes stored in a relational database. The proposed approach allows both non-standard reasoning and subsumption check be ...
168
Voted
DAGM
2011
Springer
14 years 3 months ago
2011
Springer
Conditional Random Fields (CRFs) are popular models in computer vision for solving labeling problems such as image denoising. This paper tackles the rarely addressed but important ...