Sciweavers

2657 search results - page 448 / 532
» On the complexity of hierarchical problem solving
Sort
View
GECCO
2010
Springer
233views Optimization» more  GECCO 2010»
14 years 2 months ago
Evolutionary-based conflict-free scheduling of collective communications on spidergon NoCs
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...
Jirí Jaros, Vaclav Dvorak
CDC
2009
IEEE
111views Control Systems» more  CDC 2009»
14 years 2 months ago
Minimal dynamical structure realisations with application to network reconstruction from data
— Network reconstruction, i.e., obtaining network structure from data, is a central theme in systems biology, economics, and engineering. Previous work introduced dynamical struc...
Ye Yuan, Guy-Bart Vincent Stan, Sean Warnick, Jorg...
ACCV
2009
Springer
14 years 2 months ago
Multilevel Algebraic Invariants Extraction by Incremental Fitting Scheme
Algebraic invariants extracted from coefficients of implicit polynomials (IPs) have been attractive because of its convenience for solving the recognition problem in computer visio...
Bo Zheng, Jun Takamatsu, Katsushi Ikeuchi
ECCV
2010
Springer
14 years 2 months ago
Error-tolerant Image Compositing
Abstract. Gradient-domain compositing is an essential tool in computer vision and its applications, e.g., seamless cloning, panorama stitching, shadow removal, scene completion and...
RE
2001
Springer
14 years 2 months ago
XML-Based Method and Tool for Handling Variant Requirements in Domain Models
A domain model describes common and variant requirements for a system family. UML notations used in requirements analysis and software modeling can be extended with “variation p...
Stan Jarzabek, Hongyu Zhang