Sciweavers

3875 search results - page 698 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
PKDD
1999
Springer
118views Data Mining» more  PKDD 1999»
15 years 2 months ago
Mining Possibilistic Set-Valued Rules by Generating Prime Disjunctions
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
Alexandr A. Savinov
VISUALIZATION
1998
IEEE
15 years 2 months ago
Large scale terrain visualization using the restricted quadtree triangulation
Real-time rendering of triangulated surfaces has attracted growing interest in the last few years. However, interactive visualization of very large scale grid digital elevation mo...
Renato Pajarola
COCO
1998
Springer
98views Algorithms» more  COCO 1998»
15 years 2 months ago
Probabilistic Martingales and BPTIME Classes
We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness propert...
Kenneth W. Regan, D. Sivakumar
GCB
1998
Springer
78views Biometrics» more  GCB 1998»
15 years 2 months ago
Computational approaches to identify Leucine Zippers
The leucine zipper is a dimerization domain occurring mostly in regulatory and thus in many oncogenic proteins. The leucine repeat in the sequence has been traditionally used for ...
Erich Bornberg-Bauer
IPPS
1996
IEEE
15 years 1 months ago
The Chessboard Distance Transform and the Medial Axis Transform are Interchangeable
The distance transform (DT) and the medial axis transform (MAT) are two image computation tools used to extract the information about the shape and the position of the foreground ...
Yu-Hua Lee, Shi-Jinn Horng