1024 search results - page 103 / 205 » The Generalized PatchMatch Correspondence Algorithm |
ECCC
2006
14 years 10 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
108
click to vote
TCS
2008
14 years 9 months ago
2008
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
TSP
2008
14 years 9 months ago
2008
This paper introduces a general and axiomatic approach to linear signal processing (SP) that we refer to as the algebraic signal processing theory (ASP). Basic to ASP is the linear...
GIS
2010
ACM
14 years 8 months ago
2010
ACM
We present Ontuition, a system for mapping ontologies. Transforming data to a usable format for Ontuition involves recognizing and resolving data values corresponding to concepts ...
ECML
2007
Springer
15 years 4 months ago
2007
Springer
In this paper we study the identification of sparse interaction networks as a machine learning problem. Sparsity means that we are provided with a small data set and a high number...