1489 search results - page 195 / 298 » Optimizing Feature Sets for Structured Data |
TSMC
2011
14 years 4 months ago
2011
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
PLDI
2011
ACM
14 years 25 days ago
2011
ACM
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regularâ€...
AMAI
2005
Springer
14 years 10 months ago
2005
Springer
Abstract. This paper is concerned with the reliable inference of optimal treeapproximations to the dependency structure of an unknown distribution generating data. The traditional ...
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
Dual supervision refers to the general setting of learning from both labeled examples as well as labeled features. Labeled features are naturally available in tasks such as text c...