Sciweavers

2252 search results - page 219 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
CCCG
2007
15 years 5 months ago
Cache-Oblivious Output-Sensitive Two-Dimensional Convex Hull
We consider the problem of two-dimensional outputsensitive convex hull in the cache-oblivious model. That is, we are interested in minimizing the number of cache faults caused whe...
Peyman Afshani, Arash Farzan
SODA
2003
ACM
121views Algorithms» more  SODA 2003»
15 years 5 months ago
Competitiveness via consensus
We introduce the following consensus estimate problem. Several processors hold private and possibly different lower bounds on a value. The processors do not communicate with each ...
Andrew V. Goldberg, Jason D. Hartline
ECCC
2010
106views more  ECCC 2010»
15 years 2 months ago
Hardness of Parameterized Resolution
Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dan...
Olaf Beyersdorff, Nicola Galesi, Massimo Lauria
RECOMB
2008
Springer
16 years 4 months ago
Sorting Cancer Karyotypes by Elementary Operations
Since the discovery of the "Philadelphia chromosome" in chronic myelogenous leukemia in 1960, there is an ongoing intensive research of chromosomal aberrations in cancer....
Michal Ozery-Flato, Ron Shamir
ICRA
2005
IEEE
152views Robotics» more  ICRA 2005»
15 years 9 months ago
Dynamic Vehicle Localization using Constraints Propagation Techniques on Intervals A comparison with Kalman Filtering
-In order to implement a continuous and robust dynamic localization of a mobile robot, the fusion of dead reckoning and absolute sensors is often used. Depending on the objectives ...
Amadou Gning, Philippe Bonnifait