Sciweavers

111 search results - page 11 / 23
» The Complexity of Local List Decoding
Sort
View
87
Voted
APIN
2002
70views more  APIN 2002»
15 years 8 days ago
Compact Unstructured Representations for Evolutionary Design
This paper proposes a few steps to escape structured extensive representations for objects, in the context of evolutionary Topological Optimum Design (TOD) problems: early results ...
Hatem Hamda, François Jouve, Evelyne Lutton...
81
Voted
ICPR
2006
IEEE
16 years 1 months ago
Generic Detection of Multi-Part Objects
A method is proposed to detect multi-part man-made or natural objects in complex images. It consists in first extracting simple curves and straight lines from the edge map. Then, ...
Jean-Francois Bernier, Robert Bergevin
PODC
2005
ACM
15 years 6 months ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
INFOSCALE
2007
ACM
15 years 1 months ago
Scalable problem localization for distributed systems: principles and practices
Problem localization is a critical part of providing crucial system management capabilities to modern distributed environments. One key open challenge is for problem localization ...
Rui Zhang, Bruno C. d. S. Oliveira, Alan Bivens, S...
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
15 years 6 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith