Sciweavers

732 search results - page 59 / 147
» Strongly Non-U-Shaped Learning Results by General Techniques
Sort
View
DATE
1999
IEEE
135views Hardware» more  DATE 1999»
14 years 12 hour ago
Combinational Equivalence Checking Using Satisfiability and Recursive Learning
The problem of checking the equivalence of combinational circuits is of key significance in the verification of digital circuits. In recent years, several approaches have been pro...
João P. Marques Silva, Thomas Glass
WSDM
2010
ACM
160views Data Mining» more  WSDM 2010»
14 years 5 months ago
Learning Concept Importance Using a Weighted Dependence Model
Modeling query concepts through term dependencies has been shown to have a significant positive effect on retrieval performance, especially for tasks such as web search, where rel...
Michael Bendersky, Donald Metzler, W. Bruce Croft
CPAIOR
2009
Springer
14 years 2 months ago
Learning How to Propagate Using Random Probing
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
Efstathios Stamatatos, Kostas Stergiou
WWW
2007
ACM
14 years 8 months ago
Integrating web directories by learning their structures
Documents in the Web are often organized using category trees by information providers (e.g. CNN, BBC) or search engines (e.g. Google, Yahoo!). Such category trees are commonly kn...
Christopher C. Yang, Jianfeng Lin
AIRS
2005
Springer
14 years 1 months ago
Query Expansion with the Minimum Relevance Judgments
Query expansion techniques generally select new query terms from a set of top ranked documents. Although a user’s manual judgment of those documents would much help to select goo...
Masayuki Okabe, Kyoji Umemura, Seiji Yamada