Results 1  10
of
7,507
1Byzantine FaultTolerant Consensus in Wireless Ad hoc Networks
"... Abstract—Wireless ad hoc networks, due to their inherent unreliability, pose significant challenges to the task of achieving tight coordination amongst nodes. The failure of some nodes and momentary breakdown of communications, either of accidental or malicious nature, should not result in the failu ..."
Abstract
 Add to MetaCart
where the number of omissions is σ ≤ dn−t 2 e(n − k − t) + k − 2, where k is the number of nodes required to terminate and t ≤ f is the number of nodes that are actually faulty. These characteristics make Turquois the first consensus protocol that simultaneously circumvents the FLP and the SantoroWidmayer
Reconstruction and Representation of 3D Objects with Radial Basis Functions
 Computer Graphics (SIGGRAPH ’01 Conf. Proc.), pages 67–76. ACM SIGGRAPH
, 2001
"... We use polyharmonic Radial Basis Functions (RBFs) to reconstruct smooth, manifold surfaces from pointcloud data and to repair incomplete meshes. An object's surface is defined implicitly as the zero set of an RBF fitted to the given surface data. Fast methods for fitting and evaluating RBFs al ..."
Abstract

Cited by 505 (1 self)
 Add to MetaCart
allow us to model large data sets, consisting of millions of surface points, by a single RBFpreviously an impossible task. A greedy algorithm in the fitting process reduces the number of RBF centers required to represent a surface and results in significant compression and further computational
Valgrind: A framework for heavyweight dynamic binary instrumentation
 In Proceedings of the 2007 Programming Language Design and Implementation Conference
, 2007
"... Dynamic binary instrumentation (DBI) frameworks make it easy to build dynamic binary analysis (DBA) tools such as checkers and profilers. Much of the focus on DBI frameworks has been on performance; little attention has been paid to their capabilities. As a result, we believe the potential of DBI ha ..."
Abstract

Cited by 558 (5 self)
 Add to MetaCart
Dynamic binary instrumentation (DBI) frameworks make it easy to build dynamic binary analysis (DBA) tools such as checkers and profilers. Much of the focus on DBI frameworks has been on performance; little attention has been paid to their capabilities. As a result, we believe the potential of DBI
On the (im)possibility of obfuscating programs
 Lecture Notes in Computer Science
, 2001
"... Informally, an obfuscator O is an (efficient, probabilistic) “compiler ” that takes as input a program (or circuit) P and produces a new program O(P) that has the same functionality as P yet is “unintelligible ” in some sense. Obfuscators, if they exist, would have a wide variety of cryptographic an ..."
Abstract

Cited by 348 (24 self)
 Add to MetaCart
, ” in the sense that anything one can efficiently compute given O(P), one could also efficiently compute given oracle access to P. In this work, we initiate a theoretical investigation of obfuscation. Our main result is that, even under very weak formalizations of the above intuition, obfuscation is impossible
The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks
, 2003
"... The random waypoint model is a commonly used mobility model in the simulation of ad hoc networks. It is known that the spatial distribution of network nodes moving according to this model is, in general, nonuniform. However, a closedform expression of this distribution and an indepth investigation ..."
Abstract

Cited by 377 (10 self)
 Add to MetaCart
depth investigation is still missing. This fact impairs the accuracy of the current simulation methodology of ad hoc networks and makes it impossible to relate simulationbased performance results to corresponding analytical results. To overcome these problems, we present a detailed analytical study of the spatial
The Power of Convex Relaxation: NearOptimal Matrix Completion
, 2009
"... This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a great number of applications, including the famous Netflix Prize and other similar questions in collaborative filtering. In ..."
Abstract

Cited by 359 (7 self)
 Add to MetaCart
. In general, accurate recovery of a matrix from a small number of entries is impossible; but the knowledge that the unknown matrix has low rank radically changes this premise, making the search for solutions meaningful. This paper presents optimality results quantifying the minimum number of entries needed
Finding motifs using random projections
, 2001
"... Pevzner and Sze [23] considered a precise version of the motif discovery problem and simultaneously issued an algorithmic challenge: find a motif Å of length 15, where each planted instance differs from Å in 4 positions. Whereas previous algorithms all failed to solve this (15,4)motif problem, Pevz ..."
Abstract

Cited by 285 (6 self)
 Add to MetaCart
the planted Ð � �motif are in all likelihood inherently impossible to solve. We also present experimental results on realistic biological data by identifying ribosome binding sites in prokaryotes as well as a number of known transcriptional regulatory motifs in eukaryotes. 1. CHALLENGING MOTIF PROBLEMS
On the Impossibility of
, 2009
"... When goods are substitutes, the Vickrey auction produces efficient, core outcomes that yield competitive seller revenues. In contrast, with complements, the Vickrey outcome, while efficient, is not necessarily in the core and revenue can be very low. Noncore outcomes may be perceived as unfair sin ..."
Abstract
 Add to MetaCart
to adapt the Vickrey pricing rule. For a simple environment with private information, we show that the resulting auction format yields lower than Vickrey revenues and inefficient outcomes that are on average further from the core than Vickrey outcomes. More generally, we prove that the Vickrey auction
Impossibility’
, 1998
"... We show that objections raised by Chakraverty et al (Phys. Rev. Lett. 81, 433 (1998)) to the bipolaron model of superconducting cuprates are the result of an incorrect approximation for the bipolaron energy spectrum and misuse of the bipolaron theory. The consideration, which takes into account the ..."
Abstract
 Add to MetaCart
We show that objections raised by Chakraverty et al (Phys. Rev. Lett. 81, 433 (1998)) to the bipolaron model of superconducting cuprates are the result of an incorrect approximation for the bipolaron energy spectrum and misuse of the bipolaron theory. The consideration, which takes into account
Centertrack: An IP overlay network for tracking DoS floods
 In Proceedings of USENIX Security Symposium’2000
, 2000
"... Finding the source of forged Internet Protocol (IP) datagrams in a large, highspeed network is difficult due to the design of the IP protocol and the lack of sufficient capability in most highspeed, highcapacity router implementations. Typically, not enough of the routers in such a network are cap ..."
Abstract

Cited by 254 (0 self)
 Add to MetaCart
are capable of performing the packet forwarding diagnostics required for this. As a result, trackingdown the source of a floodtype denialofservice (DoS) attack is usually difficult or impossible in these networks. CenterTrack is an overlay network, consisting of IP tunnels or other connections
Results 1  10
of
7,507