Sciweavers

8647 search results - page 472 / 1730
» The Container Selection Problem
Sort
View
DATESO
2007
103views Database» more  DATESO 2007»
15 years 7 months ago
Using BMH Algorithm to Solve Subset of XPath Queries
Boyer-Moore-Horspool (BMH) algorithm is commonly used to solve text searching problems. In this paper is used to solve the constraint subset of XPath queries offering effective alg...
David Toth
DLOG
2003
15 years 7 months ago
Rewriting Aggregate Queries using Description Logic
This paper presents an application of a DL reasoner to the optimization of an object-relational query language. Queries containing aggregate functions are difficult to optimize be...
David DeHaan, David Toman, Grant E. Weddell
MVA
1990
15 years 7 months ago
Two Systems for Converting Raster Data to Numerical Control Data
This paper describes two systems constructed for the purpose of convertingpaper and filmdocumentstotheir numerical control or digital equivalent. One retools printing wiring board...
Robert H. Thibadeau, Dale M. McNulty
CORR
2010
Springer
66views Education» more  CORR 2010»
15 years 6 months ago
The overlap number of a graph
An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The ov...
Bill Rosgen, Lorna Stewart
DM
2010
135views more  DM 2010»
15 years 6 months ago
On convexification of polygons by pops
Given a polygon P in the plane, a pop operation is the reflection of a vertex with respect to the line through its adjacent vertices. We define a family of alternating polygons, a...
Adrian Dumitrescu, Evan Hilscher