Sciweavers

4908 search results - page 103 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
GECCO
2003
Springer
127views Optimization» more  GECCO 2003»
15 years 11 months ago
Complex Function Sets Improve Symbolic Discriminant Analysis of Microarray Data
Abstract. Our ability to simultaneously measure the expression levels of thousands of genes in biological samples is providing important new opportunities for improving the diagnos...
David M. Reif, Bill C. White, Nancy Olsen, Thomas ...
ICSM
1997
IEEE
15 years 10 months ago
Reverse Architecting Approach for Complex Systems
Philips is an electronics company which operates world wide and participates in professional as well as consumer markets. The architecture of many software intensive systems are c...
René L. Krikhaar
LICS
1997
IEEE
15 years 10 months ago
The Complexity of Subtype Entailment for Simple Types
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
Fritz Henglein, Jakob Rehof
SIGGRAPH
1997
ACM
15 years 10 months ago
Progressive simplicial complexes
In this paper, we introduce the progressive simplicial complex (PSC) representation, a new format for storing and transmitting triangulated geometric models. Like the earlier prog...
Jovan Popovic, Hugues Hoppe
SIGGRAPH
1993
ACM
15 years 10 months ago
Adaptive display algorithm for interactive frame rates during visualization of complex virtual environments
We describe an adaptive display algorithm for interactive frame rates during visualization of very complex virtual environments. The algorithm relies upon a hierarchical model rep...
Thomas A. Funkhouser, Carlo H. Séquin