976 search results - page 139 / 196 » The Complexity of Timetable Construction Problems |
AWIC
2003
Springer
14 years 2 months ago
2003
Springer
Abstract Search engines, with Google at the top, have many remarkable capabilities. But what is not among them is the deduction capability—the capability to synthesize an answer ...
SIGECOM
2010
ACM
14 years 1 months ago
2010
ACM
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
SODA
1992
ACM
13 years 10 months ago
1992
ACM
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
CSDA
2008
13 years 9 months ago
2008
Tree models are valuable tools for predictive modeling and data mining. Traditional tree-growing methodologies such as CART are known to suffer from problems including greediness,...
TIP
2008
13 years 8 months ago
2008
Abstract--In digital imaging applications, data are typically obtained via a spatial subsampling procedure implemented as a color filter array--a physical construction whereby only...