31 search results - page 3 / 7 » Free Indexation: Combinatorial Analysis and a Compositional ... |
TCS
2010
13 years 4 months ago
2010
We present a new approach for an average-case analysis of algorithms and data structures that supports a non-uniform distribution of the inputs and is based on the maximum likelih...
GECCO
2006
Springer
13 years 9 months ago
2006
Springer
Metaheuristics have often been shown to be effective for difficult combinatorial optimization problems. The reason for that, however, remains unclear. A framework for a theory of ...
IOR
2011
13 years 22 days ago
2011
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
MM
2005
ACM
13 years 11 months ago
2005
ACM
Automatically extracting semantic content from audio streams can be helpful in many multimedia applications. Motivated by the known limitations of traditional supervised approache...
WWW
2008
ACM
14 years 6 months ago
2008
ACM
This paper provides initial analysis in identifying possible Web services composition using context-based semantic matching. Context-based semantic matching allows service composi...