Sciweavers

176 search results - page 35 / 36
» On the analysis of queries with counting constraints
Sort
View
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
15 years 21 days 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
PETRA
2009
ACM
15 years 6 months ago
Towards faster activity search using embedding-based subsequence matching
Event search is the problem of identifying events or activity of interest in a large database storing long sequences of activity. In this paper, our topic is the problem of identi...
Panagiotis Papapetrou, Paul Doliotis, Vassilis Ath...
WWW
2004
ACM
16 years 8 days ago
Semantic email
This paper investigates how the vision of the Semantic Web can be carried over to the realm of email. We introduce a general notion of semantic email, in which an email message co...
Luke McDowell, Oren Etzioni, Alon Y. Halevy, Henry...
BMCBI
2010
178views more  BMCBI 2010»
14 years 11 months ago
Applications of a formal approach to decipher discrete genetic networks
Background: A growing demand for tools to assist the building and analysis of biological networks exists in systems biology. We argue that the use of a formal approach is relevant...
Fabien Corblin, Eric Fanchon, Laurent Trilling
COMPSAC
2010
IEEE
14 years 9 months ago
Representing and Reasoning about Web Access Control Policies
The advent of emerging technologies such as Web services, service-oriented architecture, and cloud computing has enabled us to perform business services more efficiently and effect...
Gail-Joon Ahn, Hongxin Hu, Joohyung Lee, Yunsong M...