Sciweavers

1469 search results - page 274 / 294
» Approximate polynomial decomposition
Sort
View
62
Voted
MLG
2007
Springer
15 years 3 months ago
A Universal Kernel for Learning Regular Languages
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
Leonid Kontorovich
ICDCS
2005
IEEE
15 years 3 months ago
Optimal Component Composition for Scalable Stream Processing
Stream processing has become increasingly important with emergence of stream applications such as audio/video surveillance, stock price tracing, and sensor data analysis. A challe...
Xiaohui Gu, Philip S. Yu, Klara Nahrstedt
86
Voted
HYBRID
2001
Springer
15 years 2 months ago
Accurate Event Detection for Simulating Hybrid Systems
It has been observed that there are a variety of situations in which the most popular hybrid simulation methods can fail to properly detect the occurrence of discrete events. In th...
Joel M. Esposito, Vijay Kumar, George J. Pappas
WADS
2001
Springer
182views Algorithms» more  WADS 2001»
15 years 2 months ago
On the Complexity of Scheduling Conditional Real-Time Code
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
Samarjit Chakraborty, Thomas Erlebach, Lothar Thie...
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
15 years 1 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill