Sciweavers

332 search results - page 25 / 67
» Space Complexity vs. Query Complexity
Sort
View
ICCS
2009
Springer
14 years 4 months ago
Querying for Feature Extraction and Visualization in Climate Modeling
The ultimate goal of data visualization is to clearly portray features relevant to the problem being studied. This goal can be realized only if users can effectively communicate t...
C. Ryan Johnson, Markus Glatter, Wesley Kendall, J...
SIGMOD
2001
ACM
136views Database» more  SIGMOD 2001»
14 years 10 months ago
Selectivity Estimation using Probabilistic Models
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
Lise Getoor, Benjamin Taskar, Daphne Koller
ICCCN
2007
IEEE
14 years 4 months ago
A SpaceTime Oriented Macroprogramming Paradigm for Push-Pull Hybrid Sensor Networking
This paper proposes a spatio-temporal macroprogramming paradigm for push-pull hybrid wireless sensor networks (WSNs). The proposed paradigm, called SpaceTime Oriented Programming ...
Hiroshi Wada, Pruet Boonma, Junichi Suzuki
CCCG
2008
13 years 11 months ago
Smallest enclosing circle centered on a query line segment
Given a set of n points P = {p1, p2, . . . , pn} in the plane, we show how to preprocess P such that for any query line segment L we can report in O(log n) time the smallest enclo...
Prosenjit Bose, Stefan Langerman, Sasanka Roy
DASFAA
2009
IEEE
133views Database» more  DASFAA 2009»
14 years 4 months ago
Probabilistic Ranking in Uncertain Vector Spaces
Abstract. In many application domains, e.g. sensor databases, traffic management or recognition systems, objects have to be compared based on positionally and existentially uncert...
Thomas Bernecker, Hans-Peter Kriegel, Matthias Ren...