1298 search results - page 169 / 260 » The online set cover problem |
177
click to vote
APIN
2006
15 years 6 months ago
2006
It is not an easy task to know a priori the most appropriate fuzzy sets that cover the domains of quantitative attributes for fuzzy association rules mining. In general, it is unre...
178
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
167
click to vote
CE
2008
15 years 6 months ago
2008
Although most online learning environments are predominately text based, researchers have argued that representational support for the conceptual structure of a problem would addr...
133
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
One of the most fundamental problems in web search is how to re-rank result web pages based on user logs. Most traditional models for re-ranking assume each query has a single int...
169
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
A fundamental challenge in face recognition lies in determining what facial features are important for the identification of faces. In this paper, a novel face recognition framewo...