Sciweavers

5606 search results - page 729 / 1122
» Randomization Techniques for Graphs.
Sort
View
USS
2004
15 years 8 months ago
Static Disassembly of Obfuscated Binaries
Disassembly is the process of recovering a symbolic representation of a program's machine code instructions from its binary representation. Recently, a number of techniques h...
Christopher Krügel, William K. Robertson, Fre...
EWC
2000
97views more  EWC 2000»
15 years 6 months ago
Improving the Rationale Capture Capability of QFD
The goals of Design Rationale Capture (DRC) are improving design quality and reducing design time. These general goals have led to the design of many DRC techniques originating fro...
Yoram Reich
ISVC
2010
Springer
15 years 5 months ago
Subversion Statistics Sifter
We present Subversion Statistics Sifter, a visualisation and statistics system for exploring the structure and evolution of data contained in Subversion repositories with respect t...
Christoph Müller, Guido Reina, Michael Burch,...
CVPR
2009
IEEE
17 years 1 months ago
Observe Locally, Infer Globally: a Space-Time MRF for Detecting Abnormal Activities with Incremental Updates
We propose a space-time Markov Random Field (MRF) model to detect abnormal activities in video. The nodes in the MRF graph correspond to a grid of local regions in the video fra...
Jaechul Kim (University of Texas at Austin), Krist...
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
16 years 7 months ago
The detectability lemma and quantum gap amplification
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...