Sciweavers

1091 search results - page 96 / 219
» On the temporal dimension of search
Sort
View
WSDM
2009
ACM
115views Data Mining» more  WSDM 2009»
15 years 8 months ago
Discovering and using groups to improve personalized search
Personalized Web search takes advantage of information about an individual to identify the most relevant results for that person. A challenge for personalization lies in collectin...
Jaime Teevan, Meredith Ringel Morris, Steve Bush
122
Voted
WSDM
2010
ACM
194views Data Mining» more  WSDM 2010»
15 years 11 months ago
Ranking with Query-Dependent Loss for Web Search
Queries describe the users' search intent and therefore they play an essential role in the context of ranking for information retrieval and Web search. However, most of exist...
Jiang Bian, Tie-Yan Liu, Tao Qin, Hongyuan Zha
CEC
2009
IEEE
15 years 6 months ago
Memetic algorithm with Local search chaining for large scale continuous optimization problems
Abstract— Memetic algorithms arise as very effective algorithms to obtain reliable and high accurate solutions for complex continuous optimization problems. Nowadays, high dimens...
Daniel Molina, Manuel Lozano, Francisco Herrera
SIGSOFT
2004
ACM
16 years 2 months ago
Heuristic-guided counterexample search in FLAVERS
One of the benefits of finite-state verification (FSV) tools, such as model checkers, is that a counterexample is provided when the property cannot be verified. Not all counterexa...
Jianbin Tan, George S. Avrunin, Lori A. Clarke, Sh...
ICDE
2005
IEEE
107views Database» more  ICDE 2005»
15 years 7 months ago
The Quality vs. Time Trade-off for Approximate Image Descriptor Search
In recent years, content-based image retrieval has become more and more important in many application areas. Similarity retrieval is inherently a very demanding process, in partic...
Rut Siguroardottir, Björn Þór J&...