Sciweavers

16404 search results - page 2394 / 3281
» A set coverage problem
Sort
View
WPES
2003
ACM
16 years 28 days ago
Secure and private sequence comparisons
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other t...
Mikhail J. Atallah, Florian Kerschbaum, Wenliang D...
CAISE
2003
Springer
16 years 28 days ago
Introducing Custom Language Extensions to SQL: 1999
Abstract. Even though SQL has become widely accepted as a language for implementing relational database schemas and querying data, there are cases where s experience the need for n...
Jernej Kovse, Wolfgang Mahnke
EUROPAR
2003
Springer
16 years 27 days ago
FOBS: A Lightweight Communication Protocol for Grid Computing
The advent of high-performance networks in conjunction with low-cost, powerful computational engines has made possible the development of a new set of technologies termed computat...
Phillip M. Dickens
GD
2003
Springer
16 years 27 days ago
Fixed-Location Circular-Arc Drawing of Planar Graphs
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in t...
Alon Efrat, Cesim Erten, Stephen G. Kobourov
ICDT
2003
ACM
202views Database» more  ICDT 2003»
16 years 27 days ago
Condensed Representation of Database Repairs for Consistent Query Answering
Abstract. Repairing a database means bringing the database in accordance with a given set of integrity constraints by applying modifications that are as small as possible. In the ...
Jef Wijsen
« Prev « First page 2394 / 3281 Last » Next »