Sciweavers

2657 search results - page 252 / 532
» On the complexity of hierarchical problem solving
Sort
View
ICPR
2000
IEEE
16 years 7 months ago
A Model of Stroke Extraction from Chinese Character Images
Given the large number and complexity of Chinese characters, pattern matching based on structural decomposition and analysis is believed to be necessary and essential to off-line ...
Ruini Cao, Chew Lim Tan
STOC
2004
ACM
142views Algorithms» more  STOC 2004»
16 years 7 months ago
Lower bounds for local search by quantum arguments
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
Scott Aaronson
ATAL
2009
Springer
16 years 1 months ago
A mixed multi-unit combinatorial auctions test suite
Supply Chain Formation (SCF) is the process of determining the participants in a supply chain, who will exchange what with whom, and the terms of the exchanges. Mixed multi-unit c...
Andrea Giovannucci, Jesús Cerquides, Ulle E...
RECSYS
2009
ACM
16 years 1 months ago
Recommendations with prerequisites
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...
Aditya G. Parameswaran, Hector Garcia-Molina
ICC
2008
IEEE
121views Communications» more  ICC 2008»
16 years 1 months ago
Maximization of Network Survival Time in the Event of Intelligent and Malicious Attacks
—It is not possible to ensure that a network is absolutely secure. Therefore, network operators must continually change their defense strategies to counter attackers who constant...
Po-Hao Tsang, Frank Yeong-Sung Lin, Chun-Wei Chen