16666 search results - page 2725 / 3334 » Descriptive and Computational Complexity |
211
click to vote
CRYPTO
2001
Springer
15 years 11 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
247
click to vote
ICPP
2000
IEEE
15 years 11 months ago
2000
IEEE
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
181
click to vote
SIGGRAPH
2000
ACM
15 years 11 months ago
2000
ACM
Visualization of very complex scenes can be significantly accelerated using occlusion culling. In this paper we present a visibility preprocessing method which efficiently compu...
250
click to vote
SIGGRAPH
1999
ACM
15 years 11 months ago
1999
ACM
High contrast scenes are difficult to depict on low contrast displays without loss of important fine details and textures. Skilled artists preserve these details by drawing scen...
190
click to vote
EDCC
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. In this paper we present a new modelling approach for dependability evaluation and sensitivity analysis of Scheduled Maintenance Systems, based on a Deterministic and Sto...