Sciweavers

686 search results - page 70 / 138
» On the General Applicability of Instruction-Set Randomizatio...
Sort
View
KDD
2009
ACM
156views Data Mining» more  KDD 2009»
14 years 9 months ago
Collusion-resistant anonymous data collection method
The availability and the accuracy of the data dictate the success of a data mining application. Increasingly, there is a need to resort to on-line data collection to address the p...
Mafruz Zaman Ashrafi, See-Kiong Ng
ICDE
2007
IEEE
157views Database» more  ICDE 2007»
14 years 10 months ago
Object Distinction: Distinguishing Objects with Identical Names
Different people or objects may share identical names in the real world, which causes confusion in many applications. It is a nontrivial task to distinguish those objects, especia...
Xiaoxin Yin, Jiawei Han, Philip S. Yu
RECOMB
2003
Springer
14 years 9 months ago
Approximation of protein structure for fast similarity measures
It is shown that structural similarity between proteins can be decided well with much less information than what is used in common similarity measures. The full C representation c...
Fabian Schwarzer, Itay Lotan
STOC
2007
ACM
106views Algorithms» more  STOC 2007»
14 years 9 months ago
One sketch for all: fast algorithms for compressed sensing
Compressed Sensing is a new paradigm for acquiring the compressible signals that arise in many applications. These signals can be approximated using an amount of information much ...
Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp,...
IESS
2007
Springer
110views Hardware» more  IESS 2007»
14 years 2 months ago
Run-Time efficient Feasibility Analysis of Uni-Processor Systems with Static Priorities
: The performance of feasibility tests is crucial in many applications. When using feasibility tests online only a limited amount of analysis time is available. Run-time efficiency...
Karsten Albers, Frank Bodmann, Frank Slomka