2004 search results - page 79 / 401 » Sampling from large graphs |
135
click to vote
PR
2008
15 years 2 months ago
2008
The spectrum of a graph has been widely used in graph theory to characterise the properties of a graph and extract information from its structure. It has also been employed as a g...
120
click to vote
ICML
2007
IEEE
16 years 3 months ago
2007
IEEE
We consider the problem of learning a similarity function from a set of positive equivalence constraints, i.e. 'similar' point pairs. We define the similarity in informa...
126
click to vote
IJCAI
2003
15 years 4 months ago
2003
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
109
click to vote
BMCBI
2008
15 years 3 months ago
2008
Background: A JavaTM application is presented, which compares large numbers (n > 100) of raw FTICR mass spectra from patients and controls. Two peptide profile matrices can be ...
149
click to vote
CG
2004
Springer
15 years 2 months ago
2004
Springer
We present a new definition of an implicit surface over a noisy point cloud, based on the weighted least squares approach. It can be evaluated very fast, but artifacts are signifi...