Sciweavers

895 search results - page 158 / 179
» Using graphs for some discrete tomography problems
Sort
View
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
14 years 4 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki
ECCV
2002
Springer
14 years 9 months ago
Normalized Gradient Vector Diffusion and Image Segmentation
Abstract. In this paper, we present an approach for image segmentation, based on the existing Active Snake Model and Watershed-based Region Merging. Our algorithm includes initial ...
Zeyun Yu, Chandrajit L. Bajaj
GECCO
2005
Springer
146views Optimization» more  GECCO 2005»
14 years 28 days ago
An empirical study of the robustness of two module clustering fitness functions
Two of the attractions of search-based software engineering (SBSE) derive from the nature of the fitness functions used to guide the search. These have proved to be highly robust...
Mark Harman, Stephen Swift, Kiarash Mahdavi
CONEXT
2010
ACM
13 years 5 months ago
Profiling-By-Association: a resilient traffic profiling solution for the internet backbone
Profiling Internet backbone traffic is becoming an increasingly hard problem since users and applications are avoiding detection using traffic obfuscation and encryption. The key ...
Marios Iliofotou, Brian Gallagher, Tina Eliassi-Ra...
LCC
1994
248views Algorithms» more  LCC 1994»
13 years 11 months ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin