1403 search results - page 65 / 281 » Set cover algorithms for very large datasets |
FLAIRS
2007
15 years 3 days ago
2007
A low-effort data mining approach to labeling network event records in a WLAN is proposed. The problem being addressed is often observed in an AI and data mining strategy to netwo...
CIKM
2009
Springer
15 years 2 months ago
2009
Springer
Exact substring matching queries on large data collections can be answered using q-gram indices, that store for each occurring q-byte pattern an (ordered) posting list with the po...
104
click to vote
Publication
One of the principal bottlenecks in applying learning techniques to classification problems is the large amount of labeled training data required. Especially for images and video, ...
CVPR
2006
IEEE
15 years 11 months ago
2006
IEEE
Edge detection is one of the most studied problems in computer vision, yet it remains a very challenging task. It is difficult since often the decision for an edge cannot be made ...
112
click to vote
ASAP
2004
IEEE
15 years 1 months ago
2004
IEEE
Binary finite fields GF(2n ) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On word-oriented programmable ...