Sciweavers

3208 search results - page 543 / 642
» A Lower Bound for Primality
Sort
View
OL
2008
79views more  OL 2008»
13 years 10 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 10 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 10 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
PAMI
2006
164views more  PAMI 2006»
13 years 10 months ago
A Binary Linear Programming Formulation of the Graph Edit Distance
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
Derek Justice, Alfred O. Hero
IJAHUC
2007
111views more  IJAHUC 2007»
13 years 10 months ago
Configuring node status in a two-phase tightly integrated mode for wireless sensor networks
: In wireless sensor networks, one of the main design challenges is to save severely constrained energy resources and obtain a long system lifetime. Low cost of sensors enables us ...
Di Tian, Zhijun Lei, Nicolas D. Georganas