Sciweavers

42230 search results - page 365 / 8446
» Algorithms and Complexity Results for
Sort
View
ICDM
2007
IEEE
105views Data Mining» more  ICDM 2007»
16 years 1 months ago
Fast Mining of Complex Spatial Co-location Patterns Using GLIMIT
Most algorithms for mining interesting spatial colocations integrate the co-location / clique generation task with the interesting pattern mining task, and are usually based on th...
Florian Verhein, Ghazi Al-Naymat
INFOCOM
2005
IEEE
16 years 11 days ago
Linear time construction of redundant trees for recovery schemes enhancing QoP and QoS
— Medard, Finn, Barry and Gallager proposed an elegant recovery scheme (known as the MFBG scheme) using redundant trees. Xue, Chen and Thulasiraman extended the MFBG scheme and i...
Weiyi Zhang, Guoliang Xue, Jian Tang, Krishnaiyan ...
IFIP
2004
Springer
16 years 5 days ago
Asymptotic Behaviors of Type-2 Algorithms and Induced Baire Topologies
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
Chung-Chih Li
AAAI
2007
15 years 9 months ago
Ungreedy Methods for Chinese Deterministic Dependency Parsing
Deterministic dependency parsing has often been regarded as an efficient parsing algorithm while its parsing accuracy is a little lower than the best results reported by more comp...
Xiangyu Duan, Jun Zhao, Bo Xu
CORR
2007
Springer
109views Education» more  CORR 2007»
15 years 6 months ago
Multiresolution Approximation of Polygonal Curves in Linear Complexity
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...
Pierre-Francois Marteau, Gildas Ménier