9842 search results - page 1784 / 1969 » The Complexity of the Matching-Cut Problem |
130
Voted
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
— Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation, or message-passing, algorithm over the factor graph of the code. The tradi...
116
Voted
ICDCS
2007
IEEE
15 years 10 months ago
2007
IEEE
An electronic cash system allows users to withdraw coins, represented as bit strings, from a bank or broker, and spend those coins anonymously at participating merchants, so that ...
139
click to vote
ICDE
2007
IEEE
15 years 10 months ago
2007
IEEE
In this work, we propose a multi-relational concept discovery method for business intelligence applications. Multi-relational data mining finds interesting patterns that span ove...
129
Voted
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
121
Voted
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
Zonal co-location patterns represent subsets of featuretypes that are frequently located in a subset of space (i.e., zone). Discovering zonal spatial co-location patterns is an im...