234 search results - page 13 / 47 » Isolation, Matching, and Counting |
MST
2006
14 years 11 months ago
2006
In the late eighties, it was shown that juggling patterns can be described by strings of numbers with fascinating combinatorial properties that have since then been studied by man...
COMBINATORICS
2004
14 years 11 months ago
2004
Characteristic polynomials of random unitary matrices have been intensively studied in recent years: by number theorists in connection with Riemann zetafunction, and by theoretica...
101
click to vote
SEMWEB
2009
Springer
15 years 6 months ago
2009
Springer
A recent approach to the problem of ontology matching has been to convert the problem of ontology matching to information retrieval. We explore the utility of this approach in matc...
ICIP
2002
IEEE
16 years 1 months ago
2002
IEEE
Matching Pursuit decomposes a signal into a linear expansion of functions selected from a redundant dictionary, isolating the signal structures that are coherent with respect to a...
ESA
2004
Springer
15 years 5 months ago
2004
Springer
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, ...