644 search results - page 118 / 129 » Decomposition Complexity |
SIGIR
2009
ACM
15 years 4 months ago
2009
ACM
With the sheer growth of online user data, it becomes challenging to develop preference learning algorithms that are sufficiently flexible in modeling but also affordable in com...
ICC
2008
IEEE
15 years 4 months ago
2008
IEEE
— The complexity of current Internet applications makes the understanding of network traffic a challenging task. By providing larger-scale aggregates for analysis, unsupervised ...
CP
2007
Springer
15 years 4 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
104
click to vote
ISCAS
2006
IEEE
15 years 4 months ago
2006
IEEE
JPEG2000, the new standard for still image coding, Quantization, user defined wavelets, arbitrary wavelet provides a new framework and an integrated toolbox to better decomposition...
COMPGEOM
2006
ACM
15 years 4 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...