Sciweavers

509 search results - page 81 / 102
» Efficient indexing for large scale visual search
Sort
View
SIGMOD
2008
ACM
236views Database» more  SIGMOD 2008»
14 years 7 months ago
Approximate embedding-based subsequence matching of time series
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
Vassilis Athitsos, Panagiotis Papapetrou, Michalis...
VIS
2007
IEEE
149views Visualization» more  VIS 2007»
14 years 8 months ago
Time Dependent Processing in a Parallel Pipeline Architecture
Pipeline architectures provide a versatile and efficient mechanism for constructing visualizations, and they have been implemented in numerous libraries and applications over the p...
John Biddiscombe, Berk Geveci, Ken Martin, Kenn...
DEXAW
2005
IEEE
121views Database» more  DEXAW 2005»
14 years 1 months ago
Resource Discovery in a Dynamic Grid Environment
Resource discovery in a Grid environment is a critical problem, as a typical Grid system includes a very large number of resources, which must be readily identified and accessed ...
Moreno Marzolla, Matteo Mordacchini, Salvatore Orl...
XSYM
2004
Springer
115views Database» more  XSYM 2004»
14 years 25 days ago
XQuery Processing with Relevance Ranking
Abstract. We are presenting a coherent framework for XQuery processing that incorporates IR-style approximate matching and allows the ordering of results by their relevance score. ...
Leonidas Fegaras
WWW
2008
ACM
14 years 8 months ago
Contextual advertising by combining relevance with click feedback
Contextual advertising supports much of the Web's ecosystem today. User experience and revenue (shared by the site publisher ad the ad network) depend on the relevance of the...
Deepayan Chakrabarti, Deepak Agarwal, Vanja Josifo...