Sciweavers

2354 search results - page 180 / 471
» Assignment Problems
Sort
View
147
Voted
CPAIOR
2005
Springer
15 years 11 months ago
Filtering Algorithms for the NValue Constraint
Abstract. The NValue constraint counts the number of different values assigned to a vector of variables. Propagating generalized arc consistency on this constraint is NP-hard. We ...
Christian Bessière, Emmanuel Hebrard, Brahi...
ISPD
1999
ACM
106views Hardware» more  ISPD 1999»
15 years 10 months ago
Timing driven maze routing
—This paper studies a natural formulation of the timing-driven maze routing problem. A multigraph model appropriate for global routing applications is adopted; the model naturall...
Sung-Woo Hur, Ashok Jagannathan, John Lillis
CVPR
2010
IEEE
15 years 8 months ago
Co-clustering of Image Segments Using Convex Optimization Applied to EM Neuronal Reconstruction
This paper addresses the problem of jointly clustering two segmentations of closely correlated images. We focus in particular on the application of reconstructing neuronal structu...
Shiv Vitaladevuni, Ronen Basri
CSC
2006
15 years 7 months ago
Parallel Load Balancing Heuristics for Radiative Heat Transfer Calculations
The computation of radiative effects by the Photon Monte Carlo method is computationally demanding, especially when complex, nongray absorption models are employed. To solve such c...
Kamal Viswanath, Ivana Veljkovic, Paul E. Plassman...
ICDE
2008
IEEE
123views Database» more  ICDE 2008»
16 years 7 months ago
Handling Non-linear Polynomial Queries over Dynamic Data
Applications that monitor functions over rapidly and unpredictably changing data, express their needs as continuous queries. Our focus is on a rich class of queries, expressed as p...
Shetal Shah, Krithi Ramamritham