Sciweavers

1522 search results - page 76 / 305
» On the Complexity of Several Haplotyping Problems
Sort
View
ICALP
2007
Springer
14 years 2 months ago
Constant-Round Private Database Queries
We consider several private database query problems. The starting point of this work is the element rank problem: the server holds a database of n integers, and the user an integer...
Nenad Dedic, Payman Mohassel
ICDT
2003
ACM
126views Database» more  ICDT 2003»
14 years 1 months ago
Typechecking Top-Down Uniform Unranked Tree Transducers
We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input sc...
Wim Martens, Frank Neven
CAV
2001
Springer
107views Hardware» more  CAV 2001»
14 years 9 days ago
Job-Shop Scheduling Using Timed Automata
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...
Yasmina Abdeddaïm, Oded Maler
INFOCOM
2000
IEEE
14 years 6 days ago
Optimal Partition of QoS requirements with Discrete Cost Functions
Abstract—The future Internet is expected to support applications with quality of service (QoS) requirements. For this end several mechanisms are suggested in the IETF to support ...
Danny Raz, Yuval Shavitt
ESORICS
1998
Springer
14 years 1 days ago
Rules for Designing Multilevel Object-Oriented Databases
When implementing a multilevel security policy for Object-Oriented Databases (OODBs), several aspects have to be investigated. One of these aspect is the design of multilevel OODB...
Frédéric Cuppens, Alban Gabillon