Sciweavers

6045 search results - page 245 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
ESWS
2011
Springer
12 years 12 months ago
Optimizing Query Shortcuts in RDF Databases
The emergence of the Semantic Web has led to the creation of large semantic knowledge bases, often in the form of RDF databases. Improving the performance of RDF databases necessit...
Vicky Dritsou, Panos Constantopoulos, Antonios Del...
COMGEO
2008
ACM
13 years 8 months ago
An optimal randomized algorithm for d-variate zonoid depth
A randomized linear expected-time algorithm for computing the zonoid depth (Dyckerhoff et al 1996, Mosler 2002) of a point with respect to a fixed dimensional point set is presente...
Pat Morin
NJC
2000
169views more  NJC 2000»
13 years 8 months ago
A Type System for Bounded Space and Functional In-Place Update
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...
Martin Hofmann
CORR
2007
Springer
116views Education» more  CORR 2007»
13 years 8 months ago
Complexity of some Path Problems in DAGs and Linear Orders
We investigate here the computational complexity of three natural problems in directed acyclic graphs. We prove their NP Completeness and consider their restrictions to linear orde...
Serge Burckel
CVPR
2009
IEEE
14 years 7 days ago
Efficient image alignment using linear appearance models
Visual tracking is a key component in many computer vision applications. Linear subspace techniques (e.g. eigentracking) are one of the most popular approaches to align templates ...
Jose Gonzalez-Mora, Nicolas Guil, Emilio L. Zapata...