976 search results - page 144 / 196 » Evaluating Adversarial Partitions |
ACCV
2009
Springer
14 years 3 months ago
2009
Springer
Graph cuts based interactive segmentation has become very popular over the last decade. In standard graph cuts, the extraction of foreground object in a complex background often le...
ADC
2009
Springer
14 years 3 months ago
2009
Springer
Given a large volume of Web documents, we consider problem of finding the shortest keyword sequences for each of the documents such that a keyword sequence can be rendered to a g...
PKDD
2009
Springer
14 years 3 months ago
2009
Springer
Co-clustering has emerged as an important technique for mining contingency data matrices. However, almost all existing coclustering algorithms are hard partitioning, assigning each...
DEBS
2009
ACM
14 years 3 months ago
2009
ACM
Efficient matching of incoming events to persistent queries is fundamental to event pattern matching, complex event processing, and publish/subscribe systems. Recent processing e...
BIBM
2008
IEEE
14 years 3 months ago
2008
IEEE
We develop a parallel algorithm for a widely used whole genome alignment method called LAGAN. We use the MPI-based protocol to develop parallel solutions for two phases of the alg...