1041 search results - page 148 / 209 » Randomizing Reductions of Search Problems |
ALGORITHMICA
1998
13 years 7 months ago
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
CHI
2008
ACM
14 years 8 months ago
2008
ACM
The problem of extracting information from large collections of imagery is a challenge with few good solutions. Computers typically cannot interpret imagery as effectively as huma...
JAIR
2008
13 years 7 months ago
2008
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
ICSE
2000
IEEE-ACM
13 years 11 months ago
2000
IEEE-ACM
Developers often use electronic mailing lists when seeking assistance with a particular software application. The archives of these mailing lists provide a rich repository of prob...
DMIN
2007
13 years 9 months ago
2007
- Several algorithms have been introduced for mining frequent itemsets. The recent datasettransformation approach suffers either from the possible increasing in the number of struc...