Sciweavers

496 search results - page 47 / 100
» Machine models and lower bounds for query processing
Sort
View
DASFAA
2007
IEEE
135views Database» more  DASFAA 2007»
15 years 4 months ago
A Development of Hash-Lookup Trees to Support Querying Streaming XML
Abstract. The rapid growth in the amount of XML data and the development of publish-subscribe systems have led to great interest in processing streaming XML data. We propose the Qs...
James Cheng, Wilfred Ng
CORR
2002
Springer
104views Education» more  CORR 2002»
14 years 9 months ago
Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible
We examine a computational geometric problem concerning the structure of polymers. We model a polymer as a polygonal chain in three dimensions. Each edge splits the polymer into t...
Michael A. Soss, Jeff Erickson, Mark H. Overmars
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
15 years 2 months ago
Preemptive Online Scheduling with Reordering
We consider online preemptive scheduling of jobs, arriving one by one, on m identical parallel machines. A buffer of a fixed size K > 0, which assists in partial reordering of...
György Dósa, Leah Epstein
ADBIS
1998
Springer
97views Database» more  ADBIS 1998»
15 years 2 months ago
Using Queries with Multi-Directional Functions for Numerical Database Applications
Object-oriented database management systems are often motivated by their support for new emerging application areas such as computer-aided design and analysis systems. The object-o...
Staffan Flodin, Kjell Orsborn, Tore Risch
COLT
2004
Springer
15 years 3 months ago
Replacing Limit Learners with Equally Powerful One-Shot Query Learners
Different formal learning models address different aspects of human learning. Below we compare Gold-style learning—interpreting learning as a limiting process in which the lear...
Steffen Lange, Sandra Zilles