Sciweavers

1773 search results - page 40 / 355
» The Visibility-Voronoi Complex and Its Applications
Sort
View
BIRTHDAY
2003
Springer
15 years 7 months ago
On the Pagination of Complex Documents
The pagination problem of complex documents is in placing text and floating objects on pages in such a way that each object appears close to, but not before, its text reference. ...
Anne Brüggemann-Klein, Rolf Klein, Stefan Woh...
MICRO
2009
IEEE
147views Hardware» more  MICRO 2009»
15 years 8 months ago
Complexity effective memory access scheduling for many-core accelerator architectures
Modern DRAM systems rely on memory controllers that employ out-of-order scheduling to maximize row access locality and bank-level parallelism, which in turn maximizes DRAM bandwid...
George L. Yuan, Ali Bakhoda, Tor M. Aamodt
KDD
2012
ACM
221views Data Mining» more  KDD 2012»
13 years 4 months ago
Fast mining and forecasting of complex time-stamped events
Given huge collections of time-evolving events such as web-click logs, which consist of multiple attributes (e.g., URL, userID, timestamp), how do we find patterns and trends? Ho...
Yasuko Matsubara, Yasushi Sakurai, Christos Falout...
EUROCRYPT
1997
Springer
15 years 6 months ago
The GCHQ Protocol and Its Problems
The UK government is fielding an architecture for secure electronic mail based on the NSA’s Message Security Protocol, with a key escrow scheme inspired by Diffie-Hellman. Attem...
Ross J. Anderson, Michael Roe
COCO
2011
Springer
217views Algorithms» more  COCO 2011»
14 years 1 months ago
Noisy Interpolation of Sparse Polynomials, and Applications
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
Shubhangi Saraf, Sergey Yekhanin