Sciweavers

569 search results - page 100 / 114
» acm 1995
Sort
View
SIGMOD
1995
ACM
88views Database» more  SIGMOD 1995»
13 years 11 months ago
Semantic Assumptions and Query Evaluation in Temporal Databases
When querying a temporal database, a user often makes certain semantic assumptions on stored temporal data. This paper formalizes and studies two types of semantic assumptions: po...
Claudio Bettini, Xiaoyang Sean Wang, Elisa Bertino...
SIGMOD
1995
ACM
148views Database» more  SIGMOD 1995»
13 years 11 months ago
Copy Detection Mechanisms for Digital Documents
In a digital library system, documents are available in digital form and therefore are more easily copied and their copyrights are more easily violated. This is a very serious pro...
Sergey Brin, James Davis, Hector Garcia-Molina
SMA
1995
ACM
190views Solid Modeling» more  SMA 1995»
13 years 11 months ago
Creating solid models from single 2D sketches
We describe a method of constructing a B-rep solid model from a single hidden-line removed sketch view of a 3D object. The main steps of our approach are as follows. The sketch is...
Ian J. Grimstead, Ralph R. Martin
SPAA
1995
ACM
13 years 11 months ago
Provably Efficient Scheduling for Languages with Fine-Grained Parallelism
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...
Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
13 years 11 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski