Sciweavers

2150 search results - page 30 / 430
» On a restricted cross-intersection problem
Sort
View
82
Voted
NA
2010
62views more  NA 2010»
14 years 8 months ago
Noise-reducing cascadic multilevel methods for linear discrete ill-posed problems
Cascadic multilevel methods for the solution of linear discrete ill-posed problems with noise-reducing restriction and prolongation operators recently have been developed for the r...
Serena Morigi, Lothar Reichel, Fiorella Sgallari
COCO
2000
Springer
123views Algorithms» more  COCO 2000»
15 years 2 months ago
A Lower Bound for the Shortest Path Problem
We show that the Shortest Path Problem cannot be solved in o(log n) time on an unbounded fan-in PRAM without bit operations using poly(n) processors even when the bit-lengths of t...
Ketan Mulmuley, Pradyut Shah
CIE
2008
Springer
14 years 9 months ago
First-Order Model Checking Problems Parameterized by the Model
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
Barnaby Martin
JCO
2007
149views more  JCO 2007»
14 years 9 months ago
A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem
The 2-interval pattern problem over its various models and restrictions was proposed by Vialette (2004) for the application of RNA secondary structure prediction. We present an O(n...
Minghui Jiang
JCO
2002
96views more  JCO 2002»
14 years 9 months ago
On the Robust Single Machine Scheduling Problem
The single machine scheduling problem with sum of completion times criterion (SS) can be solved easily by the Shortest Processing Time (SPT) rule. In the case of significant uncert...
Jian Yang, Gang Yu