Sciweavers

10608 search results - page 318 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
TCS
2010
15 years 2 months ago
Iterative compression and exact algorithms
Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. Here, we show that the technique can also be useful in the design of exact exponen...
Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mat...
WAOA
2010
Springer
232views Algorithms» more  WAOA 2010»
15 years 2 months ago
Approximation Algorithms for Domination Search
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
ICPR
2006
IEEE
16 years 5 months ago
An Efficient Radical-Based Algorithm for Stroke-Order-Free Online Kanji Character Recognition
This paper investigates improvements of an online handwriting stroke-order analysis algorithm -- cube search, based on cube graph stroke-order generation model and dynamic program...
Hiroaki Sakoe, Seiichi Uchida, Wenjie Cai
ISSAC
2009
Springer
141views Mathematics» more  ISSAC 2009»
15 years 10 months ago
Algorithms for regular solutions of higher-order linear differential systems
We study systems of higher-order linear differential equations having a regular singularity at the origin. Using the properties of matrix polynomials, we develop efficient method...
Moulay A. Barkatou, Thomas Cluzeau, Carole El Bach...
ISCAS
2007
IEEE
93views Hardware» more  ISCAS 2007»
15 years 10 months ago
VLSI Implementation of a Lattice-Reduction Algorithm for Multi-Antenna Broadcast Precoding
Abstract— This paper describes the first VLSI implementation of lattice reduction (LR) aided multi-antenna broadcast precoding with vector perturbation. The considered LR scheme...
Andreas Burg, Dominik Seethaler, Gerald Matz