Sciweavers

1731 search results - page 223 / 347
» Maximum likelihood analysis of algorithms and data structure...
Sort
View
EDBT
2009
ACM
166views Database» more  EDBT 2009»
14 years 19 days ago
Neighbor-based pattern detection for windows over streaming data
The discovery of complex patterns such as clusters, outliers, and associations from huge volumes of streaming data has been recognized as critical for many domains. However, patte...
Di Yang, Elke A. Rundensteiner, Matthew O. Ward
CIKM
2009
Springer
14 years 2 months ago
Maximal metric margin partitioning for similarity search indexes
We propose a partitioning scheme for similarity search indexes that is called Maximal Metric Margin Partitioning (MMMP). MMMP divides the data on the basis of its distribution pat...
Hisashi Kurasawa, Daiji Fukagawa, Atsuhiro Takasu,...
ICDAR
2009
IEEE
13 years 5 months ago
Form Field Frame Boundary Removal for Form Processing System in Gurmukhi Script
Machine recognition of hand-filled forms is a challenging task. Form processing involves many activities including form field location, field frame boundary removal and data image...
Dharam Veer Sharma, Gurpreet Singh Lehal
MM
2004
ACM
248views Multimedia» more  MM 2004»
14 years 1 months ago
Incremental semi-supervised subspace learning for image retrieval
Subspace learning techniques are widespread in pattern recognition research. They include Principal Component Analysis (PCA), Locality Preserving Projection (LPP), etc. These tech...
Xiaofei He
STOC
2003
ACM
178views Algorithms» more  STOC 2003»
14 years 8 months ago
Uniform hashing in constant time and linear space
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
Anna Östlin, Rasmus Pagh