7913 search results - page 475 / 1583 » Information Collection on a Graph |
157
click to vote
AUSDM
2007
Springer
15 years 11 months ago
2007
Springer
To date, most association rule mining algorithms have assumed that the domains of items are either discrete or, in a limited number of cases, hierarchical, categorical or linear. ...
156
click to vote
WEA
2007
Springer
15 years 11 months ago
2007
Springer
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
151
Voted
ICPP
2005
IEEE
15 years 10 months ago
2005
IEEE
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
144
Voted
ICDM
2002
IEEE
15 years 10 months ago
2002
IEEE
Document clustering techniques mostly rely on single term analysis of the document data set, such as the Vector Space Model. To better capture the structure of documents, the unde...
160
click to vote
ICPP
2002
IEEE
15 years 10 months ago
2002
IEEE
Power aware computing has become popular recently and many techniques have been proposed to manage the energy consumption for traditional real-time applications. We have previousl...