Sciweavers

643 search results - page 56 / 129
» Parsing And Derivational Equivalence
Sort
View
ASPDAC
2009
ACM
135views Hardware» more  ASPDAC 2009»
14 years 2 months ago
Analysis of communication delay bounds for network on chips
—In network-on-chip, computing worst-case delay bound for packet delivery is crucial for designing predictable systems but yet an intractable problem due to complicated resource ...
Yue Qian, Zhonghai Lu, Wenhua Dou
SCALESPACE
2005
Springer
14 years 1 months ago
Relations Between Higher Order TV Regularization and Support Vector Regression
We study the connection between higher order total variation (TV) regularization and support vector regression (SVR) with spline kernels in a one-dimensional discrete setting. We p...
Gabriele Steidl, Stephan Didas, Julia Neumann
COCO
2001
Springer
161views Algorithms» more  COCO 2001»
14 years 4 days ago
Communication Complexity Lower Bounds by Polynomials
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
Harry Buhrman, Ronald de Wolf
DAC
1997
ACM
13 years 11 months ago
Sequence Compaction for Probabilistic Analysis of Finite-State Machines
- The objective of this paper is to provide an effective technique for accurate modeling of the external input sequences that affect the behavior of Finite State Machines (FSMs). T...
Diana Marculescu, Radu Marculescu, Massoud Pedram
ALP
1997
Springer
13 years 11 months ago
Perpetuality and Uniform Normalization
We de ne a perpetual one-step reduction strategy which enables one to construct minimal (w.r.t. Levy's ordering 2 on reductions) in nite reductions in Conditional Orthogonal ...
Zurab Khasidashvili, Mizuhito Ogawa