Sciweavers

1399 search results - page 103 / 280
» New Algorithms for k-Center and Extensions
Sort
View
VLDB
2001
ACM
66views Database» more  VLDB 2001»
14 years 1 months ago
An Evaluation of Generic Bulk Loading Techniques
Bulk loading refers to the process of creating an index from scratch for a given data set. This problem is well understood for B-trees, but so far, non-traditional index structure...
Jochen Van den Bercken, Bernhard Seeger
WIDM
2003
ACM
14 years 2 months ago
Query rewriting using views in the presence of inclusion dependencies
Query rewriting using views is an essential issue in data integration. A number of algorithms, e.g., the bucket algorithm, the inverse rules algorithm, the SVB algorithm and the M...
Qingyuan Bai, Jun Hong, Michael F. McTear
ICFEM
2009
Springer
13 years 6 months ago
Graded-CTL: Satisfiability and Symbolic Model Checking
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
Alessandro Ferrante, Margherita Napoli, Mimmo Pare...
EMSOFT
2011
Springer
12 years 8 months ago
RT-Xen: towards real-time hypervisor scheduling in xen
As system integration becomes an increasingly important challenge for complex real-time systems, there has been a significant demand for supporting real-time systems in virtualiz...
Sisu Xi, Justin Wilson, Chenyang Lu, Christopher D...
ICML
2009
IEEE
14 years 10 months ago
Trajectory prediction: learning to map situations to robot trajectories
Trajectory planning and optimization is a fundamental problem in articulated robotics. Algorithms used typically for this problem compute optimal trajectories from scratch in a ne...
Nikolay Jetchev, Marc Toussaint