1059 search results - page 32 / 212 » Improved Algorithms via Approximations of Probability Distri... |
112
click to vote
MOR
2007
14 years 9 months ago
2007
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
ANNPR
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Estimation of probability density functions (pdf) is one major topic in pattern recognition. Parametric techniques rely on an arbitrary assumption on the form of the unde...
SIGMOD
1998
ACM
15 years 1 months ago
1998
ACM
In large data recording and warehousing environments, it is often advantageous to provide fast, approximate answers to queries, whenever possible. Before DBMSs providing highly-ac...
111
click to vote
ICCV
2011
IEEE
13 years 9 months ago
2011
IEEE
The saliency of regions or objects in an image can be significantly boosted if they recur in multiple images. Leveraging this idea, cosegmentation jointly segments common regions...
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...