4560 search results - page 81 / 912 » Finding Data in the Neighborhood |
ISAAC
1995
Springer
13 years 11 months ago
1995
Springer
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
RIAO
2007
13 years 9 months ago
2007
This paper illustrates a ranking scheme which combines fulltext, anchor text and URL structure for homepage finding in hybrid peer-to-peer networks. The experimental results show...
WSC
2000
13 years 9 months ago
2000
Recent developments in software component technology have renewed the promise of reusable software. Combining this with the possibilities of sharing simulation results and models ...
HAIS
2008
Springer
13 years 9 months ago
2008
Springer
For systematic analyses of quantitative mass spectrometry data a method was developed in order to reveal peptides within a protein, that show differences in comparison with the rem...
SIAMCOMP
2002
13 years 7 months ago
2002
Given an edge-weighted graph where all weights are nonnegative reals, an edge reweighting is an assignment of nonnegative reals to edges such that, for each vertex, the sums of giv...