Sciweavers

8728 search results - page 389 / 1746
» On Reduct Construction Algorithms
Sort
View
STACS
2001
Springer
15 years 11 months ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid
ICALP
2007
Springer
15 years 10 months ago
Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...
Spyros C. Kontogiannis, Paul G. Spirakis
AUSDM
2008
Springer
211views Data Mining» more  AUSDM 2008»
15 years 8 months ago
LBR-Meta: An Efficient Algorithm for Lazy Bayesian Rules
LBR is a highly accurate classification algorithm, which lazily constructs a single Bayesian rule for each test instance at classification time. However, its computational complex...
Zhipeng Xie
APBC
2004
163views Bioinformatics» more  APBC 2004»
15 years 8 months ago
A Combined Model and a Varied Gibbs Sampling Algorithm Used for Motif Discovery
The conserved sequences in gene regulatory regions dominate gene regulation. Discovering these sequences and their functions is important in post genome era. A novel model is cons...
Xiaoming Wu, Bo Wang, Changxin Song, Jingzhi Cheng
GRAPHICSINTERFACE
2004
15 years 8 months ago
A Hybrid Hardware-Accelerated Algorithm for High Quality Rendering of Visual Hulls
In this paper, a novel hybrid algorithm is presented for the fast construction and high-quality rendering of visual hulls. We combine the strengths of two complementary hardware-a...
Ming Li, Marcus A. Magnor, Hans-Peter Seidel