Sciweavers

121 search results - page 2 / 25
» First-Order Queries over One Unary Function
Sort
View
LICS
2005
IEEE
14 years 1 months ago
Temporal Logics over Unranked Trees
We consider unranked trees, that have become an active subject of study recently due to XML applications, and characterize commonly used fragments of firstorder (FO) and monadic ...
Pablo Barceló, Leonid Libkin
CVPR
2006
IEEE
14 years 9 months ago
A Geodesic Active Contour Framework for Finding Glass
This paper addresses the problem of finding objects made of glass (or other transparent materials) in images. Since the appearance of glass objects depends for the most part on wha...
Kenton McHenry, Jean Ponce
TKDE
2012
487views Formal Methods» more  TKDE 2012»
11 years 9 months ago
Query Planning for Continuous Aggregation Queries over a Network of Data Aggregators
—Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of som...
Rajeev Gupta, Krithi Ramamritham
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 8 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
SSDBM
2003
IEEE
137views Database» more  SSDBM 2003»
14 years 20 days ago
Supporting Sliding Window Queries for Continuous Data Streams
Although traditional databases and data warehouses have been exploited widely to manage persistent data, a large number of applications from sensor network need functional support...
Lin Qiao, Divyakant Agrawal, Amr El Abbadi