Sciweavers

42 search results - page 7 / 9
» Computation of Highly Regular Nearby Points
Sort
View
STRINGOLOGY
2008
13 years 9 months ago
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
Pawel Baturo, Marcin Piatkowski, Wojciech Rytter
ET
2007
101views more  ET 2007»
13 years 7 months ago
Towards Nanoelectronics Processor Architectures
In this paper, we focus on reliability, one of the most fundamental and important challenges, in the nanoelectronics environment. For a processor architecture based on the unreliab...
Wenjing Rao, Alex Orailoglu, Ramesh Karri

Publication
794views
15 years 4 months ago
A Fast Implementation of The Level Set Method Without Solving Partial Differential Equations
"The level set method is popular in the numerical implementation of curve evolution, but its high computational cost is a bottleneck for real-time applications. In this report...
Yonggang Shi, William Clem Karl
CVPR
2009
IEEE
13 years 11 months ago
Towards high-resolution large-scale multi-view stereo
Boosted by the Middlebury challenge, the precision of dense multi-view stereovision methods has increased drastically in the past few years. Yet, most methods, although they perfo...
Vu Hoang Hiep, Renaud Keriven, Patrick Labatut, Je...
ICIP
2001
IEEE
14 years 9 months ago
B-spline active contours for fast video segmentation
Video segmentation is among the most important challenges of video processing and compression (MPEG-4 and MPEG-7). A drawback of classical methods is the computational cost due to...
Frédéric Precioso, Michel Barlaud