Sciweavers

5164 search results - page 481 / 1033
» Consistency of the EKF-SLAM Algorithm
Sort
View
PODC
2010
ACM
15 years 10 months ago
Eventually linearizable shared objects
Linearizability is the strongest known consistency property of shared objects. In asynchronous message passing systems, Linearizability can be achieved with 3S and a majority of c...
Marco Serafini, Dan Dobre, Matthias Majuntke, P&ea...
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
15 years 8 months ago
Ranged hash functions and the price of churn
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
James Aspnes, Muli Safra, Yitong Yin
SIGMOD
2010
ACM
191views Database» more  SIGMOD 2010»
15 years 7 months ago
Data conflict resolution using trust mappings
In massively collaborative projects such as scientific or community databases, users often need to agree or disagree on the content of individual data items. On the other hand, tr...
Wolfgang Gatterbauer, Dan Suciu
BMCBI
2007
144views more  BMCBI 2007»
15 years 6 months ago
Accelerated search for biomolecular network models to interpret high-throughput experimental data
Background: The functions of human cells are carried out by biomolecular networks, which include proteins, genes, and regulatory sites within DNA that encode and control protein e...
Suman Datta, Bahrad A. Sokhansanj
ANCS
2005
ACM
16 years 14 days ago
Group round robin: improving the fairness and complexity of packet scheduling
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...
Bogdan Caprita, Jason Nieh, Wong Chun Chan