4066 search results - page 26 / 814 » Improved Algorithms and Analysis for Secretary Problems and ... |
148
click to vote
AI
2003
Springer
15 years 9 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
140
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
—Physical layer techniques have come a long way and can achieve close to Shannon capacity for single pointto-point transmissions. It is apparent that, to further improve network ...
125
click to vote
STACS
2004
Springer
15 years 9 months ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
KDD
1997
ACM
15 years 8 months ago
1997
ACM
We presenthere an approachand algorithm for mining generalizedterm associations.The problem is to find co-occurrencefrequenciesof terms, given a collection of documents eachwith r...
147
click to vote
CIKM
2009
Springer
15 years 11 months 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....