Sciweavers

1132 search results - page 202 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
JUCS
2008
158views more  JUCS 2008»
13 years 7 months ago
A Linear Time Approximation Algorithm for Ruler Folding Problem
: A chain or n-link is a sequence of n links whose lengths are fixed and are joined together from their endpoints, free to turn about their endpoints, which act as joints. "Ru...
Ali Nourollah, Mohammadreza Razzazi
JEC
2006
113views more  JEC 2006»
13 years 7 months ago
CyNC: A method for real time analysis of systems with cyclic data flows
The paper addresses a novel method for realtime analysis of systems with cyclic data flows. The presented method is based on Network Calculus principles, where upper and lower flo...
Henrik Schiøler, Jens Dalsgaard Nielsen, Ki...
OL
2008
79views more  OL 2008»
13 years 7 months ago
A simpler and tighter redundant Klee-Minty construction
By introducing redundant Klee-Minty examples, we have previously shown that the central path can be bent along the edges of the Klee-Minty cubes, thus having 2n - 2 sharp turns in...
Eissa Nematollahi, Tamás Terlaky
PAMI
2008
181views more  PAMI 2008»
13 years 7 months ago
Automatic Estimation and Removal of Noise from a Single Image
Image denoising algorithms often assume an additive white Gaussian noise (AWGN) process that is independent of the actual RGB values. Such approaches cannot effectively remove colo...
Ce Liu, Richard Szeliski, Sing Bing Kang, C. Lawre...
NETWORKS
2006
13 years 7 months ago
Extreme point characterizations for infinite network flow problems
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...
H. Edwin Romeijn, Dushyant Sharma, Robert L. Smith