554 search results - page 82 / 111 » Approximation algorithms and hardness results for labeled co... |
ICDM
2010
IEEE
13 years 5 months ago
2010
IEEE
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
SPAA
2003
ACM
14 years 26 days ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
SIGMOD
1998
ACM
13 years 12 months ago
1998
ACM
Semistructured data is characterized by the lack of any fixed and rigid schema, although typically the data hassomeimplicitstructure. While thelack offixedschemamakesextracting ...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
Most prior work on information extraction has focused on extracting information from text in digital documents. However, often, the most important information being reported in an...
SDM
2004
SIAM
13 years 9 months ago
2004
SIAM
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...