Sciweavers

7766 search results - page 1428 / 1554
» Testing Nondeterminate Systems
Sort
View
SENSYS
2009
ACM
14 years 4 months ago
Achieving range-free localization beyond connectivity
Wireless sensor networks have been proposed for many location-dependent applications. In such applications, the requirement of low system cost prohibits many range-based methods f...
Ziguo Zhong, Tian He
INFOCOM
2009
IEEE
14 years 3 months ago
Detecting Spam Zombies by Monitoring Outgoing Messages
—Compromised machines are one of the key security threats on the Internet; they are often used to launch various security attacks such as DDoS, spamming, and identity theft. In t...
Zhenhai Duan, Peng Chen, Fernando Sanchez, Yingfei...
AIRWEB
2009
Springer
14 years 3 months ago
Tag spam creates large non-giant connected components
Spammers in social bookmarking systems try to mimick bookmarking behaviour of real users to gain the attention of other users or search engines. Several methods have been proposed...
Nicolas Neubauer, Robert Wetzker, Klaus Obermayer
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
14 years 3 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
14 years 3 months ago
A Convex Approach to Low Rank Matrix Approximation with Missing Data
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
Carl Olsson, Magnus Oskarsson
« Prev « First page 1428 / 1554 Last » Next »