Sciweavers

2446 search results - page 77 / 490
» Choiceless Polynomial Time
Sort
View
DAM
2008
108views more  DAM 2008»
13 years 7 months ago
Feedback vertex set on AT-free graphs
We present a polynomial time algorithm to compute a minimum (weight) feedback vertex set for AT-free graphs, and extending this approach we obtain a polynomial time algorithm for ...
Dieter Kratsch, Haiko Müller, Ioan Todinca
IJAC
2010
128views more  IJAC 2010»
13 years 6 months ago
Compressed Words and Automorphisms in Fully Residually Free Groups
We show that the compressed word problem in a finitely generated fully residually free group (F-group) is decidable in polynomial time, and use this result to show that the word ...
Jeremy MacDonald
ICDE
2009
IEEE
135views Database» more  ICDE 2009»
14 years 9 months ago
Forward Decay: A Practical Time Decay Model for Streaming Systems
Temporal data analysis in data warehouses and data streaming systems often uses time decay to reduce the importance of older tuples, without eliminating their influence, on the res...
Graham Cormode, Vladislav Shkapenyuk, Divesh Sriva...
ICASSP
2008
IEEE
14 years 2 months ago
Doppler-variant modeling of the vocal tract
A common technique to deploy linear prediction to nonstationary signals is time segmentation and local analysis. In [1], the temporal changes of linear prediction coefficients (L...
Axel Heim, Uli Sorger, Florian Hug
ACSD
2007
IEEE
88views Hardware» more  ACSD 2007»
14 years 2 months ago
Testing the executability of scenarios in general inhibitor nets
In this paper we introduce executions of place/transition Petri nets with weighted inhibitor arcs (PTI-net) as enabled labeled stratified order structures (LSOs) and present a po...
Robert Lorenz, Sebastian Mauser, Robin Bergenthum