3874 search results - page 434 / 775 » Approximation Algorithms for k-hurdle Problems |
212
click to vote
ACM
1995
15 years 10 months ago
1995
We study properties of rough sets, that is, approximations to sets of records in a database or, more formally, to subsets of the universe of an information system. A rough set is a...
167
click to vote
PPSC
1997
15 years 8 months ago
1997
It seems likely that improvements in arithmetic speed will continue to outpace advances in communication bandwidth. Furthermore, as more and more problems are working on huge datas...
175
click to vote
JAIR
2010
15 years 5 months ago
2010
Domain-specific features are important in representing problem structure throughout machine learning and decision-theoretic planning. In planning, once state features are provide...
211
click to vote
CVPR
2011
IEEE
15 years 2 months ago
2011
IEEE
Nearly every structured prediction problem in computer vision requires approximate inference due to large and complex dependencies among output labels. While graphical models prov...
181
click to vote
ECCV
2010
Springer
16 years 9 hour ago
2010
Springer
Abstract. Many computer vision problems such as object segmentation or reconstruction can be formulated in terms of labeling a set of pixels or voxels. In certain scenarios, we may...