Sciweavers

662 search results - page 7 / 133
» Approximate Queries and Representations for Large Data Seque...
Sort
View
VISUALIZATION
1993
IEEE
14 years 1 days ago
Visual Feedback in Querying Large Databases
In this paper, we describe a database query system that provides visual relevance feedback in querying large databases. The goal of our system is to support the query specificati...
Daniel A. Keim, Hans-Peter Kriegel, Thomas Seidl
CGI
1998
IEEE
14 years 5 days ago
Fast Approximate Quantitative Visibility for Complex Scenes
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...
Yiorgos Chrysanthou, Daniel Cohen-Or, Dani Lischin...
CIKM
2010
Springer
13 years 6 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
EDBT
2009
ACM
208views Database» more  EDBT 2009»
14 years 2 months ago
Flexible and efficient querying and ranking on hyperlinked data sources
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...
Ramakrishna Varadarajan, Vagelis Hristidis, Louiqa...
SEBD
2003
144views Database» more  SEBD 2003»
13 years 9 months ago
Approximate Query Answering on Sensor Network Data Streams
Abstract. Sensor networks represent a non traditional source of information, as readings generated by sensors flow continuously, leading to an infinite stream of data. Traditiona...
Alfredo Cuzzocrea, Filippo Furfaro, Elio Masciari,...