Sciweavers

32545 search results - page 79 / 6509
» Data Structures and Algorithms
Sort
View
116
Voted
ISSAC
2005
Springer
119views Mathematics» more  ISSAC 2005»
15 years 8 months ago
Computing the multiplicity structure in solving polynomial systems
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
Barry H. Dayton, Zhonggang Zeng
116
Voted
CGVR
2006
15 years 4 months ago
The New Triangulation-Simplify Algorithm of TIN
: Simplification of triangulation structure plays an important role in constructing three-dimensional modeling. In this paper, we study all of triangulation-simplify algorithm in u...
Guoqing Yao, Zhun Chen, Mao Wang
132
Voted
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
15 years 4 months ago
Learning Markov Network Structure using Few Independence Tests
In this paper we present the Dynamic Grow-Shrink Inference-based Markov network learning algorithm (abbreviated DGSIMN), which improves on GSIMN, the state-ofthe-art algorithm for...
Parichey Gandhi, Facundo Bromberg, Dimitris Margar...
111
Voted
ICDM
2003
IEEE
154views Data Mining» more  ICDM 2003»
15 years 7 months ago
Frequent Sub-Structure-Based Approaches for Classifying Chemical Compounds
In this paper we study the problem of classifying chemical compound datasets. We present a sub-structure-based classification algorithm that decouples the sub-structure discovery...
Mukund Deshpande, Michihiro Kuramochi, George Kary...
137
Voted
GFKL
2007
Springer
184views Data Mining» more  GFKL 2007»
15 years 6 months ago
FSMTree: An Efficient Algorithm for Mining Frequent Temporal Patterns
Research in the field of knowledge discovery from temporal data recently focused on a new type of data: interval sequences. In contrast to event sequences interval sequences contai...
Steffen Kempe, Jochen Hipp, Rudolf Kruse