213 search results - page 42 / 43 » Counting Independent Sets Using the Bethe Approximation |
113
click to vote
WG
2010
Springer
14 years 7 months ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
118
Voted
ICDM
2010
IEEE
14 years 7 months ago
2010
IEEE
Regression problems on massive data sets are ubiquitous in many application domains including the Internet, earth and space sciences, and finances. In many cases, regression algori...
LSSC
2001
Springer
15 years 1 months ago
2001
Springer
Abstract. Recently we presented a new approach [5, 6] to the classification problem arising in data mining. It is based on the regularization network approach, but in contrast to ...
100
click to vote
BMCBI
2004
14 years 9 months ago
2004
Background: Ranked gene lists from microarray experiments are usually analysed by assigning significance to predefined gene categories, e.g., based on functional annotations. Tool...
WADS
2007
Springer
15 years 3 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...