1920 search results - page 188 / 384 » The Complexity of the A B C Problem |
148
click to vote
INFOVIS
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper reports on the development of a visualization system for architectural lighting designers. It starts by motivating the problem as both complex in its physics and social...
167
click to vote
PODC
2009
ACM
15 years 11 months ago
2009
ACM
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...
188
click to vote
CAINE
2008
15 years 8 months ago
2008
Assembly is an NP-Hard problem, which involves comparing fragments that have a time complexity of O(n2 ). This paper presents a parallel approach for sequence assembly. The parall...
194
click to vote
CONSTRAINTS
2008
15 years 6 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
178
click to vote
IJAR
2006
15 years 6 months ago
2006
The pattern recognition problem in Ring Imaging CHerenkov (RICH) counters concerns the identification of an unknown number of rings whose centers and radii are assumed to be unkno...