194 search results - page 33 / 39 » Introduction to the Special Series |
COR
2011
13 years 4 months ago
2011
In this paper we make a comparative study of several mixed integer linear programming (MILP) formulations for resource-constrained project scheduling problems (RCPSPs). First, we ...
ICALP
2011
Springer
13 years 1 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
ICDE
2000
IEEE
14 years 11 months ago
2000
IEEE
Time-series data, which are a series of one-dimensional real numbers, have been studied in various database applications. In this paper, we extend the traditional similarity searc...
KDD
2005
ACM
14 years 10 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
KDD
2003
ACM
14 years 10 months ago
2003
ACM
A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. Consequently, the knowledge embedded in a data stream is more likely to be c...