Sciweavers

18306 search results - page 3398 / 3662
» Algorithmics in Exponential Time
Sort
View
140
Voted
IROS
2009
IEEE
214views Robotics» more  IROS 2009»
15 years 9 months ago
1-point RANSAC for EKF-based Structure from Motion
Abstract— Recently, classical pairwise Structure From Motion (SfM) techniques have been combined with non-linear global optimization (Bundle Adjustment, BA) over a sliding window...
Javier Civera, Oscar G. Grasa, Andrew J. Davison, ...
130
Voted
APPROX
2009
Springer
126views Algorithms» more  APPROX 2009»
15 years 9 months ago
Improved Inapproximability Results for Maximum k-Colorable Subgraph
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
Venkatesan Guruswami, Ali Kemal Sinop
128
Voted
BICOB
2009
Springer
15 years 9 months ago
Assembly of Large Genomes from Paired Short Reads
The de novo assembly of genomes from high-throughput short reads is an active area of research. Several promising methods have been recently developed, with applicability mainly re...
Benjamin G. Jackson, Patrick S. Schnable, Srinivas...
119
Voted
WDAG
2009
Springer
166views Algorithms» more  WDAG 2009»
15 years 9 months ago
New Bounds for the Controller Problem
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic ted tool that provides an abstraction for managing the consumption of a global resource ...
Yuval Emek, Amos Korman
145
Voted
WDAG
2009
Springer
147views Algorithms» more  WDAG 2009»
15 years 9 months ago
Compact Routing in Power-Law Graphs
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
Wei Chen, Christian Sommer 0002, Shang-Hua Teng, Y...
« Prev « First page 3398 / 3662 Last » Next »