661 search results - page 26 / 133 » Combining Information using Hard Constraints |
KDD
2007
ACM
15 years 10 months ago
2007
ACM
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
IEEECIT
2009
IEEE
15 years 4 months ago
2009
IEEE
— Knowledge about herbal medicine can be contributed from experts in several cultures. With the conventional techniques, it is hard to find the way which the experts can build a ...
IEEEARES
2008
IEEE
15 years 4 months ago
2008
IEEE
IT Security is a problem that can only be addressed and taught holistically. Just as broad as the field of ICT itself, IT Security is an integral part of all network and software ...
85
Voted
CP
2008
Springer
14 years 12 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
101
click to vote
WSDM
2010
ACM
15 years 3 months ago
2010
ACM
Ranking a set of retrieved documents according to their relevance to a given query has become a popular problem at the intersection of web search, machine learning, and informatio...