3894 search results - page 718 / 779 » Approximation Algorithms for Biclustering Problems |
102
click to vote
IJCAI
2007
15 years 4 months ago
2007
Classic direct mechanisms require full type (or utility) revelation from participating agents, something that can be very difficult in practical multi-attribute settings. In this...
136
click to vote
NIPS
2008
15 years 4 months ago
2008
Spectral clustering is useful for a wide-ranging set of applications in areas such as biological data analysis, image processing and data mining. However, the computational and/or...
135
click to vote
ESANN
2004
15 years 4 months ago
2004
Abstract. Many real world problems are given in the form of multiple measurements comprising local descriptions or tasks. We propose that a dynamical organization of a population o...
120
click to vote
AAAI
1998
15 years 4 months ago
1998
A central problem in learning in complex environmentsis balancing exploration of untested actions against exploitation of actions that are known to be good. The benefit of explora...
120
click to vote
AAAI
1992
15 years 4 months ago
1992
Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint netwo...