Sciweavers

372 search results - page 21 / 75
» time 1996
Sort
View
MST
2007
167views more  MST 2007»
14 years 12 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
VISUALIZATION
1996
IEEE
15 years 4 months ago
Real-Time Incremental Visualization of Dynamic Ultrasound Volumes Using Parallel BSP Trees
We present a method for producing real-time volume visualizations of continuously captured, arbitrarily-oriented 2D arrays (slices) of data. Our system constructs a 3D representat...
William F. Garrett, Henry Fuchs, Mary C. Whitton, ...
SIGMOD
1996
ACM
131views Database» more  SIGMOD 1996»
15 years 4 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
ICDCS
1997
IEEE
15 years 4 months ago
Connection Admission Control for Hard Real-Time Communication in ATM Networks
Connection Admission Control (CAC) is needed in ATM networks to provide Quality of Service (QoS) guarantees to real-time connections. This paper presents a CAC scheme based on a b...
Qin Zheng, Tetsuya Yokotani, Tatsuki Ichihashi, Ya...
SIAMCOMP
1998
118views more  SIAMCOMP 1998»
15 years 3 days ago
Genericity, Randomness, and Polynomial-Time Approximations
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
Yongge Wang