Sciweavers

1220 search results - page 141 / 244
» Minimal Interval Completions
Sort
View
ICDT
2007
ACM
74views Database» more  ICDT 2007»
14 years 28 days ago
World-Set Decompositions: Expressiveness and Efficient Algorithms
Uncertain information is commonplace in real-world data management scenarios. The ability to represent large sets of possible instances (worlds) while supporting efficient storage ...
Lyublena Antova, Christoph Koch, Dan Olteanu
APSEC
2004
IEEE
14 years 24 days ago
Assigning Tasks in a 24-Hour Software Development Model
With the advent of globalization and the Internet, the concept of global software development is gaining ground. The global development model opens up the possibility of 24-hour s...
Pankaj Jalote, Gourav Jain
COMPGEOM
2004
ACM
14 years 24 days ago
Intersecting quadrics: an efficient and exact implementation
We present the first complete, exact, and efficient C++ implementation for parameterizing the intersection of two implicit quadrics with integer coefficients of arbitrary size. It...
Sylvain Lazard, Luis Mariano Peñaranda, Syl...
ESA
2006
Springer
82views Algorithms» more  ESA 2006»
14 years 22 days ago
Preemptive Online Scheduling: Optimal Algorithms for All Speeds
Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize makespan. The algorithm is deterministic, yet...
Tomás Ebenlendr, Wojciech Jawor, Jiri Sgall
ISMIS
2000
Springer
14 years 19 days ago
Top-Down Query Processing in First Order Deductive Databases under the DWFS
A top-down query processing method for first order deductive databases under the disjunctive well-founded semantics (DWFS) is presented. The method is based upon a characterisation...
C. A. Johnson