Sciweavers

1020 search results - page 198 / 204
» Reconfigurable Object Consistency Model
Sort
View
183
Voted
SOICT
2010
14 years 9 months ago
Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuon...
UAIS
2010
14 years 9 months ago
Auditory universal accessibility of data tables using naturally derived prosody specification
Abstract Text documents usually embody visually oriented meta-information in the form of complex visual structures, such as tables. The semantics involved in such objects result in...
Dimitris Spiliotopoulos, Gerasimos Xydas, Georgios...
ICCV
2011
IEEE
14 years 2 months ago
Localized Principal Component Analysis based Curve Evolution: A Divide and Conquer Approach
We propose a novel localized principal component analysis (PCA) based curve evolution approach which evolves the segmenting curve semi-locally within various target regions (divis...
Vikram Appia, Balaji Ganapathy, Tracy Faber, Antho...
121
Voted
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
16 years 2 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski
130
Voted
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
16 years 2 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...