2531 search results - page 128 / 507 » Group testing in graphs |
EVOW
2006
Springer
15 years 4 months ago
2006
Springer
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
ICDM
2008
IEEE
15 years 7 months ago
2008
IEEE
Most research on Internet topology is based on active measurement methods. A major difficulty in using these tools is that one comes across many unresponsive routers. Different m...
PAKDD
2004
ACM
15 years 6 months ago
2004
ACM
This paper proposes a two-step graph partitioning method to discover constrained clusters with an objective function that follows the well-known minmax clustering principle. Compar...
115
Voted
EMNLP
2010
14 years 11 months ago
2010
Graph-based methods have gained attention in many areas of Natural Language Processing (NLP) including Word Sense Disambiguation (WSD), text summarization, keyword extraction and ...
105
click to vote
ICIP
2005
IEEE
16 years 2 months ago
2005
IEEE
This paper presents a technique to detect instances of classes (objects) according to their semantic definition in the form of a Description Graph. Classes are defined as combinat...