28888 search results - page 391 / 5778 » Computability and complexity in analysis |
178
click to vote
DCC
1999
IEEE
15 years 11 months ago
1999
IEEE
In this paper we consider the problem of searching for the best match for an input among a set of vectors, according to some predetermined metric. Examples of this problem include...
224
click to vote
AMC
2011
15 years 1 months ago
2011
This is a companion paper of [1] and [2]. In the cited papers, using the C-algorithm introduced in [3], many new examples of isochronous centers for Li´enard type equation are fou...
164
click to vote
HICSS
2009
IEEE
16 years 1 months ago
2009
IEEE
In the current state of practice, security properties of software systems are typically assessed through subjective, labor-intensive human evaluation. Moreover, much of the quanti...
155
click to vote
CAISE
2007
Springer
16 years 1 months ago
2007
Springer
Semantic matching1 is a fundamental step in implementing data sharing applications. Most systems automating this task however limit themselves to finding simple (one-to-one) match...
171
click to vote
CIARP
2005
Springer
16 years 10 days ago
2005
Springer
Tin Kam Ho and Ester Bernardò Mansilla in 2004 proposed to use data complexity measures to determine the domain of competition of the classifiers. They applied different classifie...