Sciweavers

2004 search results - page 60 / 401
» Sampling from large graphs
Sort
View
ICPR
2004
IEEE
16 years 28 days ago
A Probabilistic Approach to Learning Costs for Graph Edit Distance
Graph edit distance provides an error-tolerant way to measure distances between attributed graphs. The effectiveness of edit distance based graph classification algorithms relies ...
Horst Bunke, Michel Neuhaus
IPPS
1997
IEEE
15 years 3 months ago
Designing Efficient Distributed Algorithms Using Sampling Techniques
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
Sanguthevar Rajasekaran, David S. L. Wei
CG
2008
Springer
14 years 12 months ago
Masked photo blending: Mapping dense photographic data set on high-resolution sampled 3D models
The technological advance of sensors is producing an exponential size growth of the data coming from 3D scanning and digital photography. The production of digital 3D models consi...
Marco Callieri, Paolo Cignoni, Massimiliano Corsin...
AIRWEB
2009
Springer
15 years 6 months ago
Tag spam creates large non-giant connected components
Spammers in social bookmarking systems try to mimick bookmarking behaviour of real users to gain the attention of other users or search engines. Several methods have been proposed...
Nicolas Neubauer, Robert Wetzker, Klaus Obermayer
SIGMOD
2004
ACM
150views Database» more  SIGMOD 2004»
15 years 12 months ago
When one Sample is not Enough: Improving Text Database Selection Using Shrinkage
Database selection is an important step when searching over large numbers of distributed text databases. The database selection task relies on statistical summaries of the databas...
Panagiotis G. Ipeirotis, Luis Gravano