Sciweavers

1968 search results - page 363 / 394
» The Complexity of Valued Constraint Models
Sort
View
3DPVT
2006
IEEE
295views Visualization» more  3DPVT 2006»
13 years 10 months ago
Efficient Sparse 3D Reconstruction by Space Sweeping
This paper introduces a feature based method for the fast generation of sparse 3D point clouds from multiple images with known pose. We extract sub-pixel edge elements (2D positio...
Joachim Bauer, Christopher Zach, Horst Bischof
ATVA
2006
Springer
109views Hardware» more  ATVA 2006»
13 years 10 months ago
Proactive Leader Election in Asynchronous Shared Memory Systems
Abstract. In this paper, we give an algorithm for fault-tolerant proactive leader election in asynchronous shared memory systems, and later its formal verification. Roughly speakin...
M. C. Dharmadeep, K. Gopinath
VCIP
2003
148views Communications» more  VCIP 2003»
13 years 9 months ago
Semantic transcoding of video based on regions of interest
Traditional transcoding on multimedia has been performed from the perspectives of user terminal capabilities such as display sizes and decoding processing power, and network resou...
Jeongyeon Lim, Munchurl Kim, Jong-Nam Kim, Kyeongs...
ISMB
1996
13 years 9 months ago
Refining Neural Network Predictions for Helical Transmembrane Proteins by Dynamic Programming
For transmembrane proteins experimental determina-tion of three-dimensional structure is problematic. However, membrane proteins have important impact for molecular biology in gen...
Burkhard Rost, Rita Casadio, Piero Fariselli
TVCG
2008
134views more  TVCG 2008»
13 years 8 months ago
Balloon Focus: a Seamless Multi-Focus+Context Method for Treemaps
The treemap is one of the most popular methods for visualizing hierarchical data. When a treemap contains a large number of items, inspecting or comparing a few selected items in a...
Ying Tu, Han-Wei Shen