874 search results - page 67 / 175 » Faster Algorithms for Semi-Matching Problems |
SCHOLARPEDIA
2011
12 years 10 months ago
2011
Abstract. Scientists’ ability to generate and collect massive-scale datasets is increasing. As a result, constraints in data analysis capability rather than limitations in the av...
JMLR
2012
11 years 10 months ago
2012
In recent years there has been a lot of interest in designing principled classification algorithms over multiple cues, based on the intuitive notion that using more features shou...
AAAI
1993
13 years 9 months ago
1993
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
CP
2004
Springer
13 years 11 months ago
2004
Springer
A distributed concurrent search algorithm for distributed constraint satisfaction problems (DisCSPs) is presented. Concurrent search algorithms are composed of multiple search proc...
DCC
2004
IEEE
13 years 11 months ago
2004
IEEE
Compressed pattern matching is an emerging research area that addresses the following problem: given a file in compressed format and a pattern, report the occurrence(s) of the pat...