Sciweavers

1042 search results - page 191 / 209
» Representing real numbers in a generalized numeration system
Sort
View
EUROCRYPT
2009
Springer
16 years 1 months ago
Cube Attacks on Tweakable Black Box Polynomials
Almost any cryptographic scheme can be described by tweakable polynomials over GF(2), which contain both secret variables (e.g., key bits) and public variables (e.g., plaintext bit...
Itai Dinur, Adi Shamir
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
16 years 2 months ago
Counting at Large: Efficient Cardinality Estimation in Internet-Scale Data Networks
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...
Nikos Ntarmos, Peter Triantafillou, Gerhard Weikum
GIS
2007
ACM
16 years 2 months ago
Quality-driven geospatial data integration
Accurate and efficient integration of geospatial data is an important problem with applications in areas such as emergency response and urban planning. Some of the key challenges ...
Craig A. Knoblock, José Luis Ambite, Snehal...
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
16 years 1 months ago
Mining broad latent query aspects from search sessions
Search queries are typically very short, which means they are often underspecified or have senses that the user did not think of. A broad latent query aspect is a set of keywords ...
Xuanhui Wang, Deepayan Chakrabarti, Kunal Punera
IMC
2004
ACM
15 years 6 months ago
An analysis of live streaming workloads on the internet
In this paper, we study the live streaming workload from a large content delivery network. Our data, collected over a 3 month period, contains over 70 million requests for 5,000 d...
Kunwadee Sripanidkulchai, Bruce M. Maggs, Hui Zhan...