Sciweavers

5105 search results - page 136 / 1021
» Approximate Structural Consistency
Sort
View
ADCM
2008
136views more  ADCM 2008»
15 years 3 months ago
Learning and approximation by Gaussians on Riemannian manifolds
Learning function relations or understanding structures of data lying in manifolds embedded in huge dimensional Euclidean spaces is an important topic in learning theory. In this ...
Gui-Bo Ye, Ding-Xuan Zhou
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
16 years 4 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
147
Voted
ESWS
2009
Springer
15 years 10 months ago
Ranking Approximate Answers to Semantic Web Queries
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
166
Voted
RSCTC
2000
Springer
227views Fuzzy Logic» more  RSCTC 2000»
15 years 7 months ago
Rough Sets in Approximate Spatial Reasoning
Abstract. In spatial reasoning the qualitative description of relations between spatial regions is of practical importance and has been widely studied. Examples of such relations a...
Thomas Bittner, John G. Stell
ENTCS
2007
85views more  ENTCS 2007»
15 years 3 months ago
Proving Approximate Implementations for Probabilistic I/O Automata
In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships. We employ a task str...
Sayan Mitra, Nancy A. Lynch