Sciweavers

2743 search results - page 112 / 549
» Minimization of an M-convex Function
Sort
View
COLT
1999
Springer
14 years 1 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
PAMI
2008
198views more  PAMI 2008»
13 years 9 months ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors
Among the most exciting advances in early vision has been the development of efficient energy minimization algorithms for pixel-labeling tasks such as depth or texture computation....
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...
ACMSE
2007
ACM
14 years 1 months ago
Minimizing broadcast latency in ad hoc wireless networks
Network wide broadcasting in ad-hoc wireless networks provides important control and route establishment functionality for a number of unicast and multicast protocols. In broadcas...
Shankar M. Banik, Sridhar Radhakrishnan
TIFS
2008
154views more  TIFS 2008»
13 years 9 months ago
Data Fusion and Cost Minimization for Intrusion Detection
Abstract--Statistical pattern recognition techniques have recently been shown to provide a finer balance between misdetections and false alarms than the more conventional intrusion...
Devi Parikh, Tsuhan Chen
ASPDAC
1995
ACM
103views Hardware» more  ASPDAC 1995»
14 years 1 months ago
A scheduling algorithm for multiport memory minimization in datapath synthesis
- In this paper, we present a new scheduling algorithms that generates area-efficient register transfer level datapaths with multiport memories. The proposed scheduling algorithm a...
Hae-Dong Lee, Sun-Young Hwang