2304 search results - page 134 / 461 » On the Vulnerability of Large Graphs |
151
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
Duplicate detection determines different representations of realworld objects in a database. Recent research has considered the use of relationships among object representations t...
147
click to vote
SPIRE
2009
Springer
16 years 22 days ago
2009
Springer
The directed graph representation of the World Wide Web has been extensively used to analyze the Web structure, behavior and evolution. However, those graphs are huge and do not ...
178
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
177
click to vote
EMNLP
2010
15 years 4 months ago
2010
We describe a new scalable algorithm for semi-supervised training of conditional random fields (CRF) and its application to partof-speech (POS) tagging. The algorithm uses a simil...
137
click to vote
ICDM
2006
IEEE
16 years 7 days ago
2006
IEEE
New applications of data mining, such as in biology, bioinformatics, or sociology, are faced with large datasets structured as graphs. We present an efficient algorithm for minin...