Sciweavers

417 search results - page 62 / 84
» Generalization Bounds for Some Ordinal Regression Algorithms
Sort
View
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
14 years 2 months ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur
WDAG
2007
Springer
105views Algorithms» more  WDAG 2007»
14 years 1 months ago
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
Jérémie Chalopin, Shantanu Das, Nico...
SRDS
1999
IEEE
13 years 11 months ago
On Diffusing Updates in a Byzantine Environment
We study how to efficiently diffuse updates to a large distributed system of data replicas, some of which may exhibit arbitrary (Byzantine) failures. We assume that strictly fewer...
Dahlia Malkhi, Yishay Mansour, Michael K. Reiter
EMSOFT
2010
Springer
13 years 5 months ago
Load-based schedulability analysis of certifiable mixed-criticality systems
Many safety-critical embedded systems are subject to certification requirements. However, only a subset of the functionality of the system may be safety-critical and hence subject...
Haohan Li, Sanjoy K. Baruah
DRM
2007
Springer
14 years 1 months ago
Data structures for limited oblivious execution of programs while preserving locality of reference
We introduce a data structure for program execution under a limited oblivious execution model. For fully oblivious execution along the lines of Goldreich and Ostrovsky [2], one tr...
Avinash V. Varadarajan, Ramarathnam Venkatesan, C....