2899 search results - page 497 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
150
click to vote
SAB
2004
Springer
15 years 6 months ago
2004
Springer
While techniques exist for simulating swarming behaviors, these methods usually provide only simplistic navigation and planning capabilities. In this review, we explore the benefi...
128
click to vote
DATE
1998
IEEE
15 years 5 months ago
1998
IEEE
As the "system-on-a-chip" concept is rapidly becoming a reality, time-to-market and product complexity push the reuse of complex macromodules. Circuits combining a varie...
129
click to vote
SIGIR
2011
ACM
14 years 4 months ago
2011
ACM
The situation in which a choice is made is an important information for recommender systems. Context-aware recommenders take this information into account to make predictions. So ...
135
click to vote
CVPR
2012
IEEE
13 years 3 months ago
2012
IEEE
In this paper, we address a challenging image segmentation problem called multiple foreground cosegmentation (MFC), which concerns a realistic scenario in general Webuser photo se...
139
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...