52 search results - page 5 / 11 » Complexity and Approximation of Satisfactory Partition Probl... |
WWW
2008
ACM
14 years 8 months ago
2008
ACM
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
CP
2009
Springer
14 years 8 months ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
ICIP
1998
IEEE
13 years 12 months ago
1998
IEEE
: While lattice vector quantization (LVQ) can solve the complexity problem of LBG based vector quantizers, and also yield very general codebooks, a single stage lattice VQ, when ap...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
Histogram construction or sequence segmentation is a basic task with applications in database systems, information retrieval, and knowledge management. Its aim is to approximate a...