Sciweavers

1940 search results - page 239 / 388
» Optimizing search engines using clickthrough data
Sort
View
154
Voted
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
15 years 11 months ago
ACOhg: dealing with huge graphs
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
Enrique Alba, J. Francisco Chicano
144
Voted
ICDE
2010
IEEE
266views Database» more  ICDE 2010»
15 years 5 months ago
Ranking for data repairs
Abstract— Improving data quality is a time-consuming, laborintensive and often domain specific operation. A recent principled approach for repairing dirty database is to use dat...
Mohamed Yakout, Ahmed K. Elmagarmid, Jennifer Nevi...
ACMMSP
2004
ACM
92views Hardware» more  ACMMSP 2004»
15 years 10 months ago
Instruction combining for coalescing memory accesses using global code motion
Instruction combining is an optimization to replace a sequence of instructions with a more efficient instruction yielding the same result in a fewer machine cycles. When we use it...
Motohiro Kawahito, Hideaki Komatsu, Toshio Nakatan...
CIKM
2008
Springer
15 years 6 months ago
A language for manipulating clustered web documents results
We propose a novel conception language for exploring the results retrieved by several internet search services (like search engines) that cluster retrieved documents. The goal is ...
Gloria Bordogna, Alessandro Campi, Giuseppe Psaila...
132
Voted
LREC
2008
88views Education» more  LREC 2008»
15 years 6 months ago
An Infrastructure, Tools and Methodology for Evaluation of Multicultural Name Matching Systems
This paper describes a Name Matching Evaluation Laboratory that is a joint effort across multiple projects. The lab houses our evaluation infrastructure as well as multiple name m...
Keith J. Miller, Mark Arehart, Catherine Ball, Joh...