25 search results - page 5 / 5 » Optimal and Practical Algorithms for Sorting on the PDM |
ICDM
2007
IEEE
13 years 11 months ago
2007
IEEE
Data mining algorithms use various Trie and bitmap-based representations to optimize the support (i.e., frequency) counting performance. In this paper, we compare the memory requi...
ALENEX
2009
13 years 3 months ago
2009
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
IOR
2007
13 years 5 months ago
2007
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
TCAD
2008
13 years 5 months ago
2008
Abstract--Designers and high-level synthesis tools can introduce unwanted cycles in digital circuits, and for certain combinational functions, cyclic circuits that are stable and d...
WWW
2008
ACM
14 years 6 months ago
2008
ACM
Learning to rank is a new statistical learning technology on creating a ranking model for sorting objects. The technology has been successfully applied to web search, and is becom...