601 search results - page 87 / 121 » CSP(M): Constraint Satisfaction Problem over Models |
100
click to vote
WSDM
2009
ACM
15 years 8 months ago
2009
ACM
Readability is a crucial presentation attribute that web summarization algorithms consider while generating a querybaised web summary. Readability quality also forms an important ...
106
click to vote
CP
2008
Springer
15 years 2 months ago
2008
Springer
Rectangle (square) packing problems involve packing all squares with sizes 1 × 1 to n × n into the minimum area enclosing rectangle (respectively, square). Rectangle packing is a...
115
click to vote
ICML
2004
IEEE
16 years 2 months ago
2004
IEEE
Many difficult visual perception problems, like 3D human motion estimation, can be formulated in terms of inference using complex generative models, defined over high-dimensional ...
128
click to vote
NIPS
2008
15 years 2 months ago
2008
Language comprehension in humans is significantly constrained by memory, yet rapid, highly incremental, and capable of utilizing a wide range of contextual information to resolve ...
105
click to vote
NIPS
2008
15 years 2 months ago
2008
Query expansion is a long-studied approach for improving retrieval effectiveness by enhancing the user's original query with additional related words. Current algorithms for ...