Sciweavers

43 search results - page 1 / 9
» Relaxed selection techniques for querying time-series graphs
Sort
View
UIST
2009
ACM
13 years 11 months ago
Relaxed selection techniques for querying time-series graphs
Time-series graphs are often used to visualize phenomena that change over time. Common tasks include comparing values at different points in time and searching for specified patte...
Christian Holz, Steven Feiner
PKDD
2005
Springer
188views Data Mining» more  PKDD 2005»
13 years 10 months ago
Elastic Partial Matching of Time Series
We consider a problem of elastic matching of time series. We propose an algorithm that automatically determines a subsequence b of a target time series b that best matches a query ...
Longin Jan Latecki, Vasilis Megalooikonomou, Qiang...
CHI
2008
ACM
14 years 5 months ago
Generalized selection via interactive query relaxation
Selection is a fundamental task in interactive applications, typically performed by clicking or lassoing items of interest. However, users may require more nuanced forms of select...
Jeffrey Heer, Maneesh Agrawala, Wesley Willett
ESWS
2011
Springer
12 years 8 months ago
Optimizing Query Shortcuts in RDF Databases
The emergence of the Semantic Web has led to the creation of large semantic knowledge bases, often in the form of RDF databases. Improving the performance of RDF databases necessit...
Vicky Dritsou, Panos Constantopoulos, Antonios Del...
ICDE
2006
IEEE
146views Database» more  ICDE 2006»
14 years 5 months ago
Query Selection Techniques for Efficient Crawling of Structured Web Sources
The high quality, structured data from Web structured sources is invaluable for many applications. Hidden Web databases are not directly crawlable by Web search engines and are on...
Ping Wu, Ji-Rong Wen, Huan Liu, Wei-Ying Ma