Sciweavers

1548 search results - page 291 / 310
» Statistical Modelling of CSP Solving Algorithms Performance
Sort
View
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 9 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
ICS
2007
Tsinghua U.
14 years 2 months ago
GridRod: a dynamic runtime scheduler for grid workflows
Grid Workflows are emerging as practical programming models for solving large e-scientific problems on the Grid. However, it is typically assumed that the workflow components eith...
Shahaan Ayyub, David Abramson
ISPD
2006
ACM
158views Hardware» more  ISPD 2006»
14 years 2 months ago
Effective linear programming based placement methods
Linear programming (LP) based methods are attractive for solving the placement problem because of their ability to model Half-Perimeter Wirelength (HPWL) and timing. However, it h...
Sherief Reda, Amit Chowdhary
ICIP
1999
IEEE
14 years 1 months ago
Motion Segmentation with Level Sets
Segmentation of motion in an image sequence is one of the most challenging problems in image processing, while at the same time one that finds numerous applications. To date, a wea...
Abdol-Reza Mansouri, Janusz Konrad
TIP
2010
113views more  TIP 2010»
13 years 3 months ago
Multiplicative Noise Removal Using Variable Splitting and Constrained Optimization
Multiplicative noise (also known as speckle noise) models are central to the study of coherent imaging systems, such as synthetic aperture radar and sonar, and ultrasound and laser...
José M. Bioucas-Dias, Mário A. T. Fi...