Sciweavers

12519 search results - page 440 / 2504
» Approximation Problems Categories
Sort
View
SSDBM
2002
IEEE
122views Database» more  SSDBM 2002»
15 years 11 months ago
ATreeGrep: Approximate Searching in Unordered Trees
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...
Dennis Shasha, Jason Tsong-Li Wang, Huiyuan Shan, ...
207
Voted
CONCUR
1999
Springer
15 years 11 months ago
Approximate Symbolic Model Checking of Continuous-Time Markov Chains
d abstract) Christel Baiera, Joost-Pieter Katoenb;c and Holger Hermannsc aLehrstuhl fur Praktische Informatik II, University of Mannheim 68131 Mannheim, Germany bLehrstuhl fur Info...
Christel Baier, Joost-Pieter Katoen, Holger Herman...
DAC
1994
ACM
15 years 11 months ago
Exact and Approximate Methods for Calculating Signal and Transition Probabilities in FSMs
In this paper, we consider the problem of calculating the signal and transition probabilities of the internal nodes of the combinational logic part of a nite state machine (FSM). ...
Chi-Ying Tsui, Massoud Pedram, Alvin M. Despain
228
Voted
HIPC
2007
Springer
15 years 10 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
DAWAK
2006
Springer
15 years 10 months ago
An Approximate Approach for Mining Recently Frequent Itemsets from Data Streams
Recently, the data stream, which is an unbounded sequence of data elements generated at a rapid rate, provides a dynamic environment for collecting data sources. It is likely that ...
Jia-Ling Koh, Shu-Ning Shin