Sciweavers

2180 search results - page 259 / 436
» Algorithms for discovering bucket orders from data
Sort
View
JCIT
2010
174views more  JCIT 2010»
15 years 25 days ago
Efficient Ming of Top-K Closed Sequences
Sequence mining is an important data mining task. In order to retrieve interesting sequences from a large database, a minimum support threshold is needed to be specified. Unfortun...
Panida Songram
TVCG
2012
196views Hardware» more  TVCG 2012»
13 years 8 months ago
Robust Morse Decompositions of Piecewise Constant Vector Fields
—In this paper, we introduce a new approach to computing a Morse decomposition of a vector field on a triangulated manifold surface. The basic idea is to convert the input vector...
Andrzej Szymczak, Eugene Zhang
VCIP
2003
129views Communications» more  VCIP 2003»
15 years 7 months ago
Fast method of segmentation and indexing MPEG1-2 flow
Multimedia data accessibility depends on a precise indexing, involving a computational cost. This paper proposes a new fast method of segmentation and indexing in order to fill o...
Lionel Brunel, Pierre Mathieu
ECML
2006
Springer
15 years 9 months ago
Batch Classification with Applications in Computer Aided Diagnosis
Abstract. Most classification methods assume that the samples are drawn independently and identically from an unknown data generating distribution, yet this assumption is violated ...
Volkan Vural, Glenn Fung, Balaji Krishnapuram, Jen...
IANDC
2011
84views more  IANDC 2011»
15 years 1 months ago
Teaching randomized learners with feedback
The present paper introduces a new model for teaching randomized learners. Our new model, though based on the classical teaching dimension model, allows to study the influence of...
Frank J. Balbach, Thomas Zeugmann