Sciweavers

983 search results - page 92 / 197
» Negative-Weight Cycle Algorithms
Sort
View
WADS
2009
Springer
274views Algorithms» more  WADS 2009»
15 years 9 months ago
Approximating Transitive Reductions for Directed Networks
Abstract. We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological an...
Piotr Berman, Bhaskar DasGupta, Marek Karpinski
AAIM
2007
Springer
151views Algorithms» more  AAIM 2007»
15 years 9 months ago
Acyclic Edge Colouring of Outerplanar Graphs
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...
Rahul Muthu, N. Narayanan, C. R. Subramanian
ICAI
2004
15 years 4 months ago
Task Oriented Machine-Learning and Review
We propose an optimization algorithm to execute a previously unlearned task-oriented command in an intelligent machine. We show that a well-defined, physically bounded, task-orien...
Pierre Abdelmalek, Howard E. Michel
JSC
2010
107views more  JSC 2010»
15 years 1 months ago
Solving the conjugacy problem in Garside groups by cyclic sliding
1 We present a solution to the conjugacy decision problem and the conjugacy search problem2 in Garside groups, which is theoretically simpler than the usual one, with no loss of eï...
Volker Gebhardt, Juan González-Meneses
SAMOS
2007
Springer
15 years 9 months ago
Low-Power Twiddle Factor Unit for FFT Computation
An integral part of FFT computation are the twiddle factors, which, in software implementations, are typically stored into RAM memory implying large memory footprint and power cons...
Teemu Pitkänen, Tero Partanen, Jarmo Takala