Sciweavers

2107 search results - page 203 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
ICDE
2008
IEEE
123views Database» more  ICDE 2008»
16 years 5 months ago
Handling Non-linear Polynomial Queries over Dynamic Data
Applications that monitor functions over rapidly and unpredictably changing data, express their needs as continuous queries. Our focus is on a rich class of queries, expressed as p...
Shetal Shah, Krithi Ramamritham
CDC
2009
IEEE
180views Control Systems» more  CDC 2009»
15 years 7 months ago
Robustness analysis for Least Squares kernel based regression: an optimization approach
—In kernel based regression techniques (such as Support Vector Machines or Least Squares Support Vector Machines) it is hard to analyze the influence of perturbed inputs on the ...
Tillmann Falck, Johan A. K. Suykens, Bart De Moor
118
Voted
ICDCS
2007
IEEE
15 years 10 months ago
Approximate Covering Detection among Content-Based Subscriptions Using Space Filling Curves
We consider a problem that arises during the propagation of subscriptions in a contentbased publish-subscribe system. Subscription covering is a promising optimization that reduce...
Zhenhui Shen, Srikanta Tirthapura
ICIC
2009
Springer
15 years 1 months ago
Inference of Differential Equation Models by Multi Expression Programming for Gene Regulatory Networks
This paper presents an evolutionary method for identifying the gene regulatory network from the observed time series data of gene expression using a system of ordinary differential...
Bin Yang, Yuehui Chen, Qingfang Meng
133
Voted
IWPEC
2009
Springer
15 years 10 months ago
Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
Peter Damaschke