4843 search results - page 755 / 969 » The Shortcut Problem - Complexity and Approximation |
131
Voted
CIKM
2010
Springer
15 years 1 months ago
2010
Springer
In this paper, we study a novel problem Collective Active Learning, in which we aim to select a batch set of "informative" instances from a networking data set to query ...
132
Voted
ICDM
2010
IEEE
15 years 1 months ago
2010
IEEE
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similar...
189
Voted
ICDM
2009
IEEE
15 years 1 months ago
2009
IEEE
Abstract--The data in many disciplines such as social networks, web analysis, etc. is link-based, and the link structure can be exploited for many different data mining tasks. In t...
146
Voted
ANOR
2010
15 years 1 months ago
2010
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...
153
click to vote
CORR
2010
Springer
15 years 9 days ago
2010
Springer
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...