Sciweavers

1175 search results - page 130 / 235
» A scalable method for the generation of small test sets
Sort
View
PR
1998
86views more  PR 1998»
13 years 9 months ago
Optimizing the cost matrix for approximate string matching using genetic algorithms
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
Marc Parizeau, Nadia Ghazzali, Jean-Françoi...
ICCV
2011
IEEE
12 years 9 months ago
iGroup : Weakly supervised image and video grouping
We present a generic, efficient and iterative algorithm for interactively clustering classes of images and videos. The approach moves away from the use of large hand labelled tra...
Andrew Gilbert, Richard Bowden
DM
2006
128views more  DM 2006»
13 years 9 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
DASFAA
2004
IEEE
135views Database» more  DASFAA 2004»
14 years 1 months ago
Semi-supervised Text Classification Using Partitioned EM
Text classification using a small labeled set and a large unlabeled data is seen as a promising technique to reduce the labor-intensive and time consuming effort of labeling traini...
Gao Cong, Wee Sun Lee, Haoran Wu, Bing Liu
SIGCOMM
2010
ACM
13 years 9 months ago
Source flow: handling millions of flows on flow-based nodes
Flow-based networks such as OpenFlow-based networks have difficulty handling a large number of flows in a node due to the capacity limitation of search engine devices such as tern...
Yasunobu Chiba, Yusuke Shinohara, Hideyuki Shimoni...