Sciweavers

13784 search results - page 2569 / 2757
» On Computing Functions with Uncertainty
Sort
View
PODC
2010
ACM
15 years 10 months ago
Deterministic distributed vertex coloring in polylogarithmic time
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
Leonid Barenboim, Michael Elkin
EUROCAST
2007
Springer
132views Hardware» more  EUROCAST 2007»
15 years 10 months ago
Using Omnidirectional BTS and Different Evolutionary Approaches to Solve the RND Problem
RND (Radio Network Design) is an important problem in mobile telecommunications (for example in mobile/cellular telephony), being also relevant in the rising area of sensor network...
Miguel A. Vega-Rodríguez, Juan Antonio G&oa...
EXPCS
2007
15 years 10 months ago
Rapid file system development using ptrace
Developing kernel-level file systems is a difficult task that requires a significant time investment. For experimental file systems, it is desirable to develop a prototype before ...
Richard P. Spillane, Charles P. Wright, Gopalan Si...
SP
2010
IEEE
217views Security Privacy» more  SP 2010»
15 years 10 months ago
Experimental Security Analysis of a Modern Automobile
Abstract—Modern automobiles are no longer mere mechanical devices; they are pervasively monitored and controlled by dozens of digital computers coordinated via internal vehicular...
Karl Koscher, Alexei Czeskis, Franziska Roesner, S...
GROUP
2007
ACM
15 years 10 months ago
Privacy in the open: how attention mediates awareness and privacy in open-plan offices
The tension between privacy and awareness has been a persistent difficulty in distributed environments that support opportunistic and informal interaction. For example, many aware...
Jeremy P. Birnholtz, Carl Gutwin, Kirstie Hawkey
« Prev « First page 2569 / 2757 Last » Next »