Sciweavers

11740 search results - page 437 / 2348
» More Problems in Rewriting
Sort
View
COR
2011
15 years 1 months ago
Time-constrained project scheduling with adjacent resources
We develop a decomposition method for the Time-Constrained Project Scheduling Problem (TCPSP) with Adjacent Resources. For adjacent resources the resource units are ordered and th...
Johann Hurink, A. L. Kok, Jacob Jan Paulus, J. M. ...
IJNSEC
2011
143views more  IJNSEC 2011»
15 years 1 months ago
Probable Security Proof of A Blind Signature Scheme over Braid Groups
In this paper, we reinvestigate the security analysis of blind signature scheme over braid groups proposed by Verma in 2008. A blind signature scheme is a cryptographic primitive ...
Girraj Kumar Verma
MSS
2011
IEEE
178views Hardware» more  MSS 2011»
15 years 1 months ago
Framing contingencies in contracts
The paper develops a contracting model where the principal frames the contract when the agent is unaware of some contingencies, yet is aware that she may be unaware. We call the c...
Xiaojian Zhao
JMLR
2010
128views more  JMLR 2010»
15 years 1 months ago
Learning Causal Structure from Overlapping Variable Sets
We present an algorithm name cSAT+ for learning the causal structure in a domain from datasets measuring different variable sets. The algorithm outputs a graph with edges correspo...
Sofia Triantafilou, Ioannis Tsamardinos, Ioannis G...
JSCIC
2010
231views more  JSCIC 2010»
15 years 1 months ago
Geometric Applications of the Split Bregman Method: Segmentation and Surface Reconstruction
Variational models for image segmentation have many applications, but can be slow to compute. Recently, globally convex segmentation models have been introduced which are very rel...
Tom Goldstein, Xavier Bresson, Stanley Osher