771 search results - page 12 / 155 » Efficient Web Searching Using Temporal Factors |
152
click to vote
VLDB
2002
ACM
15 years 10 months ago
2002
ACM
Several organizations have developed very large market basket databases for the maintenance of customer transactions. New applications, e.g., Web recommendation systems, present th...
WWW
2005
ACM
15 years 10 months ago
2005
ACM
In contrast with the current Web search methods that essentially do document-level ranking and retrieval, we are exploring a new paradigm to enable Web search at the object level....
ACG
2006
Springer
15 years 1 months ago
2006
Springer
Amazons is a two-player perfect information game with a high branching factor, particularly in the opening. Therefore, improving the efficiency of the search is important for impro...
BMCBI
2006
14 years 9 months ago
2006
Background: Identifying cis-regulatory elements is crucial to understanding gene expression, which highlights the importance of the computational detection of overrepresented tran...
AICOM
2004
14 years 9 months ago
2004
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...