5316 search results - page 308 / 1064 » Which Search Problems Are Random |
182
click to vote
CIKM
2009
Springer
16 years 25 days ago
2009
Springer
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....
143
click to vote
ICCS
2009
Springer
16 years 24 days ago
2009
Springer
Recent years have seen growth in the number of algorithms designed to solve challenging simulation-based nonlinear optimization problems. One such algorithm is the Trust-Region Par...
211
Voted
KDD
2004
ACM
15 years 11 months ago
2004
ACM
Semantic understanding of multimedia content is critical in enabling effective access to all forms of digital media data. By making large media repositories searchable, semantic ...
297
click to vote
MICCAI
2009
Springer
15 years 8 months ago
2009
Springer
We present a novel method for globally optimal surface segmentation of multiple mutually interacting objects, incorporating both edge and shape knowledge in a 3-D graph-theoretic a...
148
click to vote
IJCAI
2007
15 years 7 months ago
2007
In this paper we propose a suite of techniques for planning with temporally extended preferences (TEPs). To this end, we propose a method for compiling TEP planning problems into ...