Sciweavers

1963 search results - page 254 / 393
» The Maximum Solution Problem on Graphs
Sort
View
DLT
2008
15 years 2 months ago
On the Relation between Periodicity and Unbordered Factors of Finite Words
Finite words and their overlap properties are considered in this paper. Let w be a finite word of length n with period p and where the maximum length of its unbordered factors equ...
Stepan Holub, Dirk Nowotka
116
Voted
TIP
1998
129views more  TIP 1998»
15 years 11 days ago
Minimax partial distortion competitive learning for optimal codebook design
— The design of the optimal codebook for a given codebook size and input source is a challenging puzzle that remains to be solved. The key problem in optimal codebook design is h...
Ce Zhu, Lai-Man Po
CVPR
2012
IEEE
13 years 3 months ago
Robust camera self-calibration from monocular images of Manhattan worlds
We focus on the detection of orthogonal vanishing points using line segments extracted from a single view, and using these for camera self-calibration. Recent methods view this pr...
Horst Wildenauer, Allan Hanbury
SIAMDM
2010
149views more  SIAMDM 2010»
14 years 11 months ago
Formal Theory of Noisy Sensor Network Localization
Graph theory has been used to characterize the solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs betwee...
Brian D. O. Anderson, Iman Shames, Guoqiang Mao, B...
102
Voted
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
16 years 1 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski