Sciweavers

186 search results - page 6 / 38
» Tractability of Theory Patching
Sort
View
MOC
2002
118views more  MOC 2002»
15 years 10 hour ago
The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
Dimensionally unbounded problems are frequently encountered in practice, such as in simulations of stochastic processes, in particle and light transport problems and in the problem...
Fred J. Hickernell, Xiaoqun Wang
PODS
2010
ACM
181views Database» more  PODS 2010»
15 years 5 months ago
Schema design for XML repositories: complexity and tractability
Abiteboul et al. initiated the systematic study of distributed XML documents consisting of several logical parts, possibly located on different machines. The physical distributio...
Wim Martens, Matthias Niewerth, Thomas Schwentick
CIKM
2011
Springer
14 years 9 days ago
Tractable XML data exchange via relations
We consider data exchange for XML documents: given source and target schemas, a mapping between them, and a document conforming to the source schema, construct a target document a...
Rada Chirkova, Leonid Libkin, Juan L. Reutter
110
Voted
PAMI
2010
249views more  PAMI 2010»
14 years 10 months ago
Fast Keypoint Recognition Using Random Ferns
While feature point recognition is a key component of modern approaches to object detection, existing approaches require computationally expensive patch preprocessing to handle pe...
Mustafa Özuysal, Michael Calonder, Vincent Le...
176
Voted
SIGMOD
2005
ACM
99views Database» more  SIGMOD 2005»
16 years 15 days ago
Query answering exploiting structural properties
We review the notion of hypertree width, a measure of the degree of cyclicity of hypergraphs that is useful for identifying and solving efficiently easy instances of hard problems...
Francesco Scarcello