Sciweavers

5624 search results - page 773 / 1125
» On Conditional Covering Problem
Sort
View
SIGMOD
1996
ACM
131views Database» more  SIGMOD 1996»
15 years 9 months ago
Materialized View Maintenance and Integrity Constraint Checking: Trading Space for Time
We investigate the problem of incremental maintenance of an SQL view in the face of database updates, and show that it is possible to reduce the total time cost of view maintenanc...
Kenneth A. Ross, Divesh Srivastava, S. Sudarshan
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
15 years 6 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
MCU
2007
113views Hardware» more  MCU 2007»
15 years 6 months ago
On the Computational Capabilities of Several Models
We review some results about the computational power of several computational models. Considered models have in common to be related to continuous dynamical systems. 1 Dynamical Sy...
Olivier Bournez, Emmanuel Hainry
ANOR
2008
69views more  ANOR 2008»
15 years 4 months ago
Scheduling vessels and container-yard operations with conflicting objectives
Abstract We consider the problem of coordinating the operations of two supply chain partners: a foreign shipping company and a domestic port. The two partners have conflicting busi...
Endre Boros, Lei Lei, Yao Zhao, Hua Zhong
JAIR
2008
102views more  JAIR 2008»
15 years 4 months ago
An Ordinal Bargaining Solution with Fixed-Point Property
Shapley's impossibility result indicates that the two-person bargaining problem has no non-trivial ordinal solution with the traditional game-theoretic bargaining model. Alth...
Dongmo Zhang, Yan Zhang