Sciweavers

1723 search results - page 135 / 345
» Cycling in linear programming problems
Sort
View
ASIACRYPT
2008
Springer
15 years 1 days ago
Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes
Strongly multiplicative linear secret sharing schemes (LSSS) have been a powerful tool for constructing secure multi-party computation protocols. However, it remains open whether o...
Zhifang Zhang, Mulan Liu, Yeow Meng Chee, San Ling...
AAIM
2007
Springer
151views Algorithms» more  AAIM 2007»
15 years 4 months ago
Acyclic Edge Colouring of Outerplanar Graphs
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...
Rahul Muthu, N. Narayanan, C. R. Subramanian
ICISP
2010
Springer
15 years 1 months ago
Total Variation Minimization with Separable Sensing Operator
Compressed Imaging is the theory that studies the problem of image recovery from an under-determined system of linear measurements. One of the most popular methods in this field i...
Serge L. Shishkin, Hongcheng Wang, Gregory S. Hage...
ECOOP
2004
Springer
15 years 3 months ago
Dynamic Framed Aspects for Dynamic Software Evolution
Software evolution is an inevitable process when developing a system of any notable size and is the most costly stage in the life cycle of a system. Automating parts of this proces...
Philip Greenwood
SSD
2005
Springer
188views Database» more  SSD 2005»
15 years 3 months ago
Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Results
Abstract. Evacuation planning is critical for numerous important applications, e.g. disaster emergency management and homeland defense preparation. Efficient tools are needed to pr...
Qingsong Lu, Betsy George, Shashi Shekhar