Sciweavers

1018 search results - page 200 / 204
» On the minimization of XPath queries
Sort
View
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
14 years 10 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
ESORICS
2010
Springer
14 years 10 months ago
Web Browser History Detection as a Real-World Privacy Threat
Web browser history detection using CSS visited styles has long been dismissed as an issue of marginal impact. However, due to recent changes in Web usage patterns, coupled with br...
Artur Janc, Lukasz Olejnik
BMCBI
2010
178views more  BMCBI 2010»
14 years 9 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
IPM
2008
100views more  IPM 2008»
14 years 9 months ago
Query-level loss functions for information retrieval
Many machine learning technologies such as support vector machines, boosting, and neural networks have been applied to the ranking problem in information retrieval. However, since...
Tao Qin, Xu-Dong Zhang, Ming-Feng Tsai, De-Sheng W...
77
Voted
IPM
2006
108views more  IPM 2006»
14 years 9 months ago
Using searcher simulations to redesign a polyrepresentative implicit feedback interface
Information seeking is traditionally conducted in environments where search results are represented at the user interface by a minimal amount of meta-information such as titles an...
Ryen W. White