Sciweavers

887 search results - page 83 / 178
» A Science of Reasoning
Sort
View
GI
2003
Springer
14 years 2 months ago
Byzantine Failures and Security: Arbitrary is not (always) Random
: The Byzantine failure model allows arbitrary behavior of a certain fraction of network nodes in a distributed system. It was introduced to model and analyze the effects of very s...
Felix C. Gärtner
ACSC
2002
IEEE
14 years 1 months ago
Signature Extraction for Overlap Detection in Documents
Easy access to the Web has led to increased potential for students cheating on assignments by plagiarising others’ work. By the same token, Web-based tools offer the potential f...
Raphael A. Finkel, Arkady B. Zaslavsky, Kriszti&aa...
GI
2009
Springer
14 years 1 months ago
Activity Recognition using Optical Sensors on Mobile Phones
: Each mobile phone with a built-in CMOS sensor can inherently be seen as sophisticated optical sensor being able to analyze its environment in terms of visual events and its own m...
Michael Wittke, Uwe Jänen, Aret Duraslan, Emr...
STACS
2001
Springer
14 years 1 months ago
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
Abstract. Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as s...
Philipp Woelfel
FOCS
2000
IEEE
14 years 1 months ago
Fast parallel circuits for the quantum Fourier transform
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
Richard Cleve, John Watrous