12836 search results - page 380 / 2568 » Generalization Methods in Bioinformatics |
172
Voted
CG
2002
Springer
15 years 6 months ago
2002
Springer
Convolution surface has the advantage of being crease-free and bulge-free over other kinds of implicit surfaces. Among the various types of skeletal elements, line segments can be...
174
click to vote
DATAMINE
1999
15 years 5 months ago
1999
Abstract. One of the de ning challenges for the KDD research community is to enable inductive learning algorithms to mine very large databases. This paper summarizes, categorizes, ...
173
click to vote
MOC
1998
15 years 5 months ago
1998
In this paper, we present a theory for bounding the minimum eigenvalues, maximum eigenvalues, and condition numbers of stiffness matrices arising from the p-version of finite ele...
182
click to vote
JMLR
2010
15 years 4 months ago
2010
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
165
click to vote
CHI
2010
ACM
15 years 4 months ago
2010
ACM
Hierarchical structures with large fan-outs are hard to browse and understand. In the conventional node-link tree visualization, the screen quickly becomes overcrowded as users op...