845 search results - page 80 / 169 » Complexity Dimensions and Learnability |
101
Voted
ESCIENCE
2006
IEEE
15 years 4 months ago
2006
IEEE
In this paper we present a general domain for the analysis of workflows and workflow components based on the notion of a collection of Turing machines sharing a set of tapes. We s...
103
Voted
LREC
2010
15 years 2 months ago
2010
Ontology-based semantic annotation aims at putting fragments of a text in correspondence with proper elements of an ontology such that the formal semantics encoded by the ontology...
113
click to vote
ALGORITHMICA
2010
15 years 28 days ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
88
Voted
MP
2008
15 years 23 days ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
93
Voted
JMIV
2010
14 years 11 months ago
2010
Preserving topological properties of objects during thinning procedures is an important issue in the field of image analysis. In the case of 2-D digital images (i.e. images defi...