Sciweavers

2746 search results - page 107 / 550
» Bisubmodular Function Minimization
Sort
View
131
Voted
COLT
1999
Springer
15 years 7 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
114
Voted
TCAD
1998
86views more  TCAD 1998»
15 years 3 months ago
Fast heuristic and exact algorithms for two-level hazard-free logic minimization
None of the available minimizers for 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to manual and auto...
Michael Theobald, Steven M. Nowick
PAMI
2008
198views more  PAMI 2008»
15 years 3 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, ...
154
Voted
ACMSE
2007
ACM
15 years 7 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»
15 years 3 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