Sciweavers

1403 search results - page 144 / 281
» Set cover algorithms for very large datasets
Sort
View
149
Voted
ICDAR
2009
IEEE
16 years 25 days ago
Line Segmentation for Degraded Handwritten Historical Documents
We propose a novel approach for text line segmentation based on adaptive local projection profiles. Our algorithm is suitable for degraded documents with text lines written in la...
Itay Bar Yosef, Nate Hagbi, Klara Kedem, Its'hak D...
INFOCOM
2006
IEEE
16 years 3 days ago
Reverse Hashing for High-Speed Network Monitoring: Algorithms, Evaluation, and Applications
— A key function for network traffic monitoring and analysis is the ability to perform aggregate queries over multiple data streams. Change detection is an important primitive w...
Robert T. Schweller, Zhichun Li, Yan Chen, Yan Gao...
186
Voted
DASFAA
2006
IEEE
183views Database» more  DASFAA 2006»
16 years 4 days ago
Probabilistic Similarity Join on Uncertain Data
An important database primitive for commonly used feature databases is the similarity join. It combines two datasets based on some similarity predicate into one set such that the n...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
IJON
2006
95views more  IJON 2006»
15 years 6 months ago
Ensemble classifiers based on correlation analysis for DNA microarray classification
Since accurate classification of DNA microarray is a very important issue for the treatment of cancer, it is more desirable to make a decision by combining the results of various ...
Kyung-Joong Kim, Sung-Bae Cho
ESANN
2004
15 years 7 months ago
Neural networks for data mining: constrains and open problems
When we talk about using neural networks for data mining we have in mind the original data mining scope and challenge. How did neural networks meet this challenge? Can we run neura...
Razvan Andonie, Boris Kovalerchuk