Sciweavers

18306 search results - page 461 / 3662
» Algorithmics in Exponential Time
Sort
View
ECRTS
2004
IEEE
15 years 11 months ago
Maintaining Data Freshness in Distributed Real-Time Databases
Many real-time systems need to maintain fresh views which are derived from shared data that are distributed among multiple sites. When a base data item changes, all derived views ...
Yuan Wei, Sang Hyuk Son, John A. Stankovic
ENTCS
2008
101views more  ENTCS 2008»
15 years 7 months ago
Model Checking Quantitative Linear Time Logic
This paper considers QLtl, a quantitative analagon of Ltl and presents algorithms for model checking QLtl over quantitative versions of Kripke structures and Markov chains.
Marco Faella, Axel Legay, Mariëlle Stoelinga
IPL
2008
98views more  IPL 2008»
15 years 7 months ago
Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time
Given two strings, a pattern P of length m and a text T of length n over some alphabet , we consider the string matching problem under k mismatches. The well
Szymon Grabowski, Kimmo Fredriksson
PVLDB
2010
129views more  PVLDB 2010»
15 years 6 months ago
Graph Pattern Matching: From Intractable to Polynomial Time
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Ying...
TASLP
2011
15 years 2 months ago
Time-Domain Blind Separation of Audio Sources on the Basis of a Complete ICA Decomposition of an Observation Space
—Time-domain algorithms for blind separation of audio sources can be classified as being based either on a partial or complete decomposition of an observation space. The decompo...
Zbynek Koldovský, Petr Tichavský