Sciweavers

10271 search results - page 1840 / 2055
» Self-plagiarism in computer science
Sort
View
AB
2007
Springer
16 years 22 days ago
Algebraic Systems Biology: Theses and Hypotheses
What is systems biology? What can biologists gain from an attempt to algebraize the questions in systems biology? Starting with plausible biological theses, can one algebraically m...
Bud Mishra
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
16 years 21 days ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim
ASIACRYPT
2007
Springer
16 years 21 days ago
Blind Identity-Based Encryption and Simulatable Oblivious Transfer
An extended abstract of this paper appears in Kaoru Kurosawa (Ed.): Advances in Cryptology ASIACRYPT 2007, volume 4833 of Lecture Notes in Computer Science, pages 265–282, Spring...
Matthew Green, Susan Hohenberger
ATAL
2007
Springer
16 years 21 days ago
Commitment and extortion
Making commitments, e.g., through promises and threats, enables a player to exploit the strengths of his own strategic position as well as the weaknesses of that of his opponents....
Paul Harrenstein, Felix Brandt, Felix A. Fischer
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
16 years 21 days ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey
« Prev « First page 1840 / 2055 Last » Next »