Sciweavers

2168 search results - page 377 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
196
Voted
SAC
2008
ACM
15 years 3 months ago
IELR(1): practical LR(1) parser tables for non-LR(1) grammars with conflict resolution
There has been a recent effort in the literature to reconsider grammar-dependent software development from an engineering point of view. As part of that effort, we examine a defic...
Joel E. Denny, Brian A. Malloy
149
Voted
TRIDENTCOM
2010
IEEE
15 years 1 months ago
Polymorphic Ubiquitous Network Testbed RUBIQ
In this paper we present RUBIQ, a polymorphic ubiquitous network testbed. RUBIQ works on StarBED, which is a network testbed consisting of hundreds of PCs connected to each other. ...
Junya Nakata, Razvan Beuran, Takashi Okada, Ken-ic...
154
Voted
CONEXT
2009
ACM
15 years 1 months ago
Lockr: better privacy for social networks
Today's online social networking (OSN) sites do little to protect the privacy of their users' social networking information. Given the highly sensitive nature of the inf...
Amin Tootoonchian, Stefan Saroiu, Yashar Ganjali, ...
144
Voted
CCS
2009
ACM
15 years 10 months ago
On non-cooperative location privacy: a game-theoretic analysis
In mobile networks, authentication is a required primitive of the majority of security protocols. However, an adversary can track the location of mobile nodes by monitoring pseudo...
Julien Freudiger, Mohammad Hossein Manshaei, Jean-...
156
Voted
DIALM
2007
ACM
144views Algorithms» more  DIALM 2007»
15 years 7 months ago
Reliable Local Broadcast in a Wireless Network Prone to Byzantine Failures
Reliable broadcast can be a very useful primitive for many distributed applications, especially in the context of sensoractuator networks. Recently, the issue of reliable broadcas...
Vartika Bhandari, Nitin H. Vaidya