Sciweavers

10271 search results - page 1882 / 2055
» Computer Science
Sort
View
PODC
2009
ACM
16 years 1 months ago
Fast scalable deterministic consensus for crash failures
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
MOBICOM
2010
ACM
15 years 6 months ago
Privacy vulnerability of published anonymous mobility traces
Mobility traces of people and vehicles have been collected and published to assist the design and evaluation of mobile networks, such as large-scale urban sensing networks. Althou...
Chris Y. T. Ma, David K. Y. Yau, Nung Kwan Yip, Na...
CPM
2007
Springer
115views Combinatorics» more  CPM 2007»
16 years 18 days ago
Two-Dimensional Range Minimum Queries
We consider the two-dimensional Range Minimum Query problem: for a static (m × n)-matrix of size N = mn which may be preprocessed, answer on-line queries of the form “where is t...
Amihood Amir, Johannes Fischer, Moshe Lewenstein
BMCBI
2006
100views more  BMCBI 2006»
15 years 6 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong
CVPR
2006
IEEE
16 years 8 months ago
Image Matching Using Photometric Information
Image matching is an essential task in many computer vision applications. It is obvious that thorough utilization of all available information is critical for the success of match...
Michael Kolomenkin, Ilan Shimshoni
« Prev « First page 1882 / 2055 Last » Next »