Sciweavers

1220 search results - page 27 / 244
» Minimal Interval Completions
Sort
View
WADT
1998
Springer
14 years 1 months ago
Complete Strategies for Term Graph Narrowing
Abstract. Narrowing is a method for solving equations in the equational theories of term rewriting systems. Unification and rewriting, the central operations in narrowing, are ofte...
Annegret Habel, Detlef Plump
ICASSP
2011
IEEE
13 years 15 days ago
Low-rank matrix completion with geometric performance guarantees
—The low-rank matrix completion problem can be stated as follows: given a subset of the entries of a matrix, find a low-rank matrix consistent with the observations. There exist...
Wei Dai, Ely Kerman, Olgica Milenkovic
IPCO
2004
142views Optimization» more  IPCO 2004»
13 years 10 months ago
The Constrained Minimum Weighted Sum of Job Completion Times Problem
We consider the problem of minimizing the weighted sum of job completion times on a single machine (subject to certain job weights) with an additional side constraint on the weigh...
Asaf Levin, Gerhard J. Woeginger
AAAI
1997
13 years 10 months ago
Query Optimization Using Local Completeness
We consider the problem of query plan optimization in information brokers. Information brokers are programs that facilitate access to collections of information sources by hiding ...
Oliver M. Duschka
SOFSEM
2005
Springer
14 years 2 months ago
Outerplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete p-Partite Graphs
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one s...
Radoslav Fulek, Hongmei He, Ondrej Sýkora, ...