Sciweavers

5115 search results - page 429 / 1023
» On Randomized Lanczos Algorithms
Sort
View
STOC
2003
ACM
90views Algorithms» more  STOC 2003»
16 years 7 months ago
Work-competitive scheduling for cooperative computing with dynamic groups
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
Chryssis Georgiou, Alexander Russell, Alexander A....
SASN
2006
ACM
16 years 1 months ago
RANBAR: RANSAC-based resilient aggregation in sensor networks
We present a novel outlier elimination technique designed for sensor networks. This technique is called RANBAR and it is based on the RANSAC (RANdom SAmple Consensus) paradigm, wh...
Levente Buttyán, Péter Schaffer, Ist...
ECCV
2008
Springer
16 years 9 months ago
Latent Pose Estimator for Continuous Action Recognition
Recently, models based on conditional random fields (CRF) have produced promising results on labeling sequential data in several scientific fields. However, in the vision task of c...
Huazhong Ning, Wei Xu, Yihong Gong, Thomas S. Huan...
251
Voted
VEE
2006
ACM
142views Virtualization» more  VEE 2006»
16 years 1 months ago
Secure and practical defense against code-injection attacks using software dynamic translation
One of the most common forms of security attacks involves exploiting a vulnerability to inject malicious code into an executing application and then cause the injected code to be ...
Wei Hu, Jason Hiser, Daniel Williams, Adrian Filip...
ICDT
2005
ACM
124views Database» more  ICDT 2005»
16 years 1 months ago
Optimal Distributed Declustering Using Replication
A common technique for improving performance for database query retrieval is to decluster the database among multiple disks so that retrievals can be parallelized. In this paper we...
Keith B. Frikken