Sciweavers

306 search results - page 19 / 62
» On the Minimal Uncompletable Word Problem
Sort
View
INFORMATICALT
2000
96views more  INFORMATICALT 2000»
13 years 7 months ago
Investigation of Dead-Point Situations in the Simulation of Wet Film Evolution
The result of simulation of an idealized thin wet film connecting fixed points in the Euclidean plane is a length-minimizing curve. Gradually increasing the exterior pressure we ar...
Vydunas Saltenis
DISOPT
2008
89views more  DISOPT 2008»
13 years 7 months ago
Group sequencing around a common due date
The problem of scheduling groups of jobs on a single machine under the group technology assumption is studied. Jobs of the same group are processed contiguously and a sequence ind...
T. C. Edwin Cheng, Mikhail Y. Kovalyov, C. T. Ng, ...
INFSOF
2008
85views more  INFSOF 2008»
13 years 7 months ago
Locating dependence structures using search-based slicing
This paper introduces an approach to locating dependence structures in a program by searching the space of the powerset of the set of all possible program slices. The paper formul...
Tao Jiang, Nicolas Gold, Mark Harman, Zheng Li
STOC
2006
ACM
152views Algorithms» more  STOC 2006»
14 years 7 months ago
Private approximation of search problems
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
SIAMIS
2011
13 years 2 months ago
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
Abstract. Accurate signal recovery or image reconstruction from indirect and possibly undersampled data is a topic of considerable interest; for example, the literature in the rece...
Stephen Becker, Jérôme Bobin, Emmanue...