Sciweavers

2252 search results - page 384 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
RECOMB
2006
Springer
14 years 9 months ago
Inferring Gene Orders from Gene Maps Using the Breakpoint Distance
Abstract. Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usual...
Guillaume Blin, Eric Blais, Pierre Guillon, Mathie...
CODES
2005
IEEE
14 years 2 months ago
Conflict analysis in multiprocess synthesis for optimized system integration
This paper presents a novel approach for multiprocess synthesis supporting well-tailored module integration at system level. The goal is to extend the local scope of existing arch...
Oliver Bringmann, Wolfgang Rosenstiel, Axel Sieben...
JSS
2007
93views more  JSS 2007»
13 years 8 months ago
Resource management for real-time tasks in mobile robotics
Coordinated behavior of mobile robots is an important emerging application area. Different coordinated behaviors can be achieved by assigning sets of control tasks, or strategies...
Huan Li, Krithi Ramamritham, Prashant J. Shenoy, R...
EMNLP
2011
12 years 8 months ago
Training a Log-Linear Parser with Loss Functions via Softmax-Margin
Log-linear parsing models are often trained by optimizing likelihood, but we would prefer to optimise for a task-specific metric like Fmeasure. Softmax-margin is a convex objecti...
Michael Auli, Adam Lopez
ICALP
2009
Springer
14 years 9 months ago
Limits and Applications of Group Algebras for Parameterized Problems
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
Ioannis Koutis, Ryan Williams