Sciweavers

3134 search results - page 223 / 627
» Computing full disjunctions
Sort
View
132
Voted
IACR
2011
133views more  IACR 2011»
14 years 3 months ago
Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings
Barreto-Lynn-Scott (BLS) curves are a stand-out candidate for implementing high-security pairings. This paper shows that particular choices of the pairing-friendly search parameter...
Craig Costello, Kristin Lauter, Michael Naehrig
200
Voted
IHI
2012
266views Healthcare» more  IHI 2012»
13 years 11 months ago
A software tool for large-scale sharing and querying of clinical documents modeled using HL7 version 3 standard
We present a novel software tool called CDN (Collaborative Data Network) for large-scale sharing and querying of clinical documents modeled using HL7 v3 standard (e.g., Clinical D...
Praveen R. Rao, Tivakar Komara Swami, Deepthi S. R...
159
Voted
WSDM
2012
ACM
267views Data Mining» more  WSDM 2012»
13 years 11 months ago
Learning to rank with multi-aspect relevance for vertical search
Many vertical search tasks such as local search focus on specific domains. The meaning of relevance in these verticals is domain-specific and usually consists of multiple well-d...
Changsung Kang, Xuanhui Wang, Yi Chang, Belle L. T...
SIAMCOMP
2012
13 years 6 months ago
Randomized Competitive Algorithms for Generalized Caching
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
Nikhil Bansal, Niv Buchbinder, Joseph Naor
164
Voted
EDBT
2012
ACM
228views Database» more  EDBT 2012»
13 years 6 months ago
Towards scalable data integration under constraints
In this paper we consider the problem of answering queries using views, with or without ontological constraints, which is important for data integration, query optimization, and d...
George Konstantinidis, José Luis Ambite