Sciweavers

7773 search results - page 1231 / 1555
» On generalized Frame-Stewart numbers
Sort
View
CASES
2007
ACM
15 years 10 months ago
Rethinking custom ISE identification: a new processor-agnostic method
The last decade has witnessed the emergence of the Application Specific Instruction-set Processor (ASIP) as a viable platform for embedded systems. Extensible ASIPs allow the user...
Ajay K. Verma, Philip Brisk, Paolo Ienne
KDD
2010
ACM
203views Data Mining» more  KDD 2010»
15 years 10 months ago
Collusion-resistant privacy-preserving data mining
Recent research in privacy-preserving data mining (PPDM) has become increasingly popular due to the wide application of data mining and the increased concern regarding the protect...
Bin Yang, Hiroshi Nakagawa, Issei Sato, Jun Sakuma
GECCO
2006
Springer
180views Optimization» more  GECCO 2006»
15 years 10 months ago
Growth of self-canceling code in evolutionary systems
This research examines the behavior of inoperative code (introns) in the evolution of genetically robust solutions. Genetically robust solutions are solutions that are less likely...
Xue Zhong, Terence Soule
CCS
2001
ACM
15 years 10 months ago
A verifiable secret shuffle and its application to e-voting
We present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universa...
C. Andrew Neff
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
15 years 8 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
« Prev « First page 1231 / 1555 Last » Next »