681 search results - page 57 / 137 » General Polynomial Time Decomposition Algorithms |
139
click to vote
ALT
2003
Springer
15 years 6 months ago
2003
Springer
Due to the rapid growth of tree structured data such as Web documents, efficient learning from tree structured data becomes more and more important. In order to represent structura...
122
click to vote
KDD
2006
ACM
16 years 3 months ago
2006
ACM
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
128
click to vote
WISEC
2009
ACM
15 years 10 months ago
2009
ACM
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
162
click to vote
SODA
2010
ACM
16 years 15 days ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
130
click to vote
IPCO
2007
15 years 4 months ago
2007
According to the present state of the theory of the matroid matching problem, the existence of a good characterization to the size of a maximum matching depends on the behavior of ...