3204 search results - page 245 / 641 » The b-chromatic Number of a Graph |
101
Voted
AUSDM
2007
Springer
15 years 6 months ago
2007
Springer
To date, most association rule mining algorithms have assumed that the domains of items are either discrete or, in a limited number of cases, hierarchical, categorical or linear. ...
96
Voted
ICDM
2006
IEEE
15 years 6 months ago
2006
IEEE
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
127
Voted
ACIVS
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Image segmentation using graph cuts have become very popular in the last years. These methods are computationally expensive, even with hard constraints (seed pixels). We ...
97
Voted
COCOON
2003
Springer
15 years 6 months ago
2003
Springer
We design efficient competitive algorithms for discovering hidden information using few queries. Specifically, consider a game in a given set of intervals (and their implied inte...
115
click to vote
GLVLSI
2002
IEEE
15 years 5 months ago
2002
IEEE
Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). ...