Sciweavers

422 search results - page 76 / 85
» Generalizations of small profinite structures
Sort
View
ICSE
2008
IEEE-ACM
14 years 8 months ago
Answering conceptual queries with Ferret
Programmers seek to answer questions as they investigate the functioning of a software system, such as "which execution path is being taken in this case?" Programmers at...
Brian de Alwis, Gail C. Murphy
ASPLOS
2009
ACM
14 years 8 months ago
Phantom-BTB: a virtualized branch target buffer design
Modern processors use branch target buffers (BTBs) to predict the target address of branches such that they can fetch ahead in the instruction stream increasing concurrency and pe...
Ioana Burcea, Andreas Moshovos
EUROCRYPT
2009
Springer
14 years 8 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
KDD
2004
ACM
143views Data Mining» more  KDD 2004»
14 years 7 months ago
Incremental maintenance of quotient cube for median
Data cube pre-computation is an important concept for supporting OLAP(Online Analytical Processing) and has been studied extensively. It is often not feasible to compute a complet...
Cuiping Li, Gao Cong, Anthony K. H. Tung, Shan Wan...
KDD
2001
ACM
203views Data Mining» more  KDD 2001»
14 years 7 months ago
Ensemble-index: a new approach to indexing large databases
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
Eamonn J. Keogh, Selina Chu, Michael J. Pazzani