Sciweavers

6253 search results - page 1175 / 1251
» Use Case Modeling Guidelines
Sort
View
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
16 years 3 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah
SIGMOD
2006
ACM
111views Database» more  SIGMOD 2006»
16 years 3 months ago
Reconciling while tolerating disagreement in collaborative data sharing
In many data sharing settings, such as within the biological and biomedical communities, global data consistency is not always attainable: different sites' data may be dirty,...
Nicholas E. Taylor, Zachary G. Ives
CVPR
2010
IEEE
15 years 11 months ago
Scalable Active Matching
In matching tasks in computer vision, and particularly in real-time tracking from video, there are generally strong priors available on absolute and relative correspondence locati...
Ankur Handa, Margarita Chli, Hauke Strasdat, Andre...
CSE
2009
IEEE
15 years 10 months ago
On the Design of a Suitable Hardware Platform for Protocol Stack Processing in LTE Terminals
—In this paper we present a design methodology for the identification and development of a suitable hardware platform (including dedicated hardware accelerators) for the data pl...
Sebastian Hessel, David Szczesny, Shadi Traboulsi,...
116
Voted
CSE
2009
IEEE
15 years 10 months ago
Inferring Unobservable Inter-community Links in Large Social Networks
Abstract—Social networks can be used to model social interactions between individuals. In many circumstances, not all interactions between individuals are observed. In such cases...
Heath Hohwald, Manuel Cebrián, Arturo Canal...
« Prev « First page 1175 / 1251 Last » Next »