Sciweavers

77 search results - page 12 / 16
» Practical Large-Scale Distributed Key Generation
Sort
View
EMMCVPR
2011
Springer
12 years 7 months ago
Data-Driven Importance Distributions for Articulated Tracking
Abstract. We present two data-driven importance distributions for particle filterbased articulated tracking; one based on background subtraction, another on depth information. In ...
Søren Hauberg, Kim Steenstrup Pedersen
INFOCOM
2007
IEEE
14 years 1 months ago
Network Coding for Distributed Storage Systems
—Distributed storage systems provide reliable access to data through redundancy spread over individually unreliable nodes. Application scenarios include data centers, peer-to-pee...
Alexandros G. Dimakis, Brighten Godfrey, Martin J....
IPSN
2009
Springer
14 years 2 months ago
Distributed resource management and matching in sensor networks
We consider a scenario in which there are resources at or near nodes of a network, which are either static (e.g. fire stations, parking spots) or mobile (e.g. police cars). Over ...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
ML
2006
ACM
103views Machine Learning» more  ML 2006»
14 years 1 months ago
Type-safe distributed programming for OCaml
Existing ML-like languages guarantee type-safety, ensuring memty and protecting the invariants of abstract types, but only within single executions of single programs. Distributed...
John Billings, Peter Sewell, Mark R. Shinwell, Rok...
EOR
2008
106views more  EOR 2008»
13 years 7 months ago
Analysis of a discrete-time preemptive resume priority buffer
In this paper, we analyze a discrete-time preemptive resume priority queue. We consider two classes of customers which have to be served, where customers of one class have preempt...
Joris Walraevens, Bart Steyaert, Herwig Bruneel