130 search results - page 15 / 26 » Finding and Certifying Loops |
142
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
Many problems in computer vision can be modeled using
conditional Markov random fields (CRF). Since finding
the maximum a posteriori (MAP) solution in such models
is NP-hard, mu...
138
click to vote
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
Hidden Markov Models (HMMs) model sequential data in many fields such as text/speech processing and biosignal analysis. Active learning algorithms learn faster and/or better by cl...
124
click to vote
ISPASS
2009
IEEE
15 years 11 months ago
2009
IEEE
Insights into branch predictor organization and operation can be used in architecture-aware compiler optimizations to improve program performance. Unfortunately, such details are ...
125
click to vote
SMA
2005
ACM
15 years 9 months ago
2005
ACM
Given a planar set S of arbitrary topology and a radius r, we show how to construct an r-tightening of S, which is a set whose boundary has a radius of curvature everywhere greate...
124
Voted
PLDI
1999
ACM
15 years 8 months ago
1999
ACM
Whole program paths (WPP) are a new approach to capturing and representing a program’s dynamic—actually executed—control flow. Unlike other path profiling techniques, which ...