Sciweavers

1091 search results - page 81 / 219
» On the temporal dimension of search
Sort
View
ICWE
2010
Springer
15 years 3 months ago
Designing Service Marts for Engineering Search Computing Applications
: The use of patterns in data management is not new: in data warehousing, data marts are simple conceptual schemas with exactly one core entity, describing facts, surrounded by mul...
Alessandro Campi, Stefano Ceri, Andrea Maesani, St...
CIKM
2008
Springer
15 years 3 months ago
A metric cache for similarity search
Similarity search in metric spaces is a general paradigm that can be used in several application fields. It can also be effectively exploited in content-based image retrieval syst...
Fabrizio Falchi, Claudio Lucchese, Salvatore Orlan...
113
Voted
CVPR
2008
IEEE
16 years 3 months ago
Fast image search for learned metrics
We introduce a method that enables scalable image search for learned metrics. Given pairwise similarity and dissimilarity constraints between some images, we learn a Mahalanobis d...
Prateek Jain, Brian Kulis, Kristen Grauman
116
Voted
KDD
2005
ACM
137views Data Mining» more  KDD 2005»
16 years 2 months ago
Pattern-based similarity search for microarray data
One fundamental task in near-neighbor search as well as other similarity matching efforts is to find a distance function that can efficiently quantify the similarity between two o...
Haixun Wang, Jian Pei, Philip S. Yu
113
Voted
GECCO
2007
Springer
193views Optimization» more  GECCO 2007»
15 years 8 months ago
Approximating covering problems by randomized search heuristics using multi-objective models
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann,...