Sciweavers

1626 search results - page 203 / 326
» Hybrid computing algorithm in representing solid model
Sort
View
IJCV
2008
201views more  IJCV 2008»
15 years 3 months ago
Probabilistic Fusion of Stereo with Color and Contrast for Bi-Layer Segmentation
This paper describes two algorithms for the real-time segmentation of foreground from background layers in stereo video sequences. Automatic separation of layers from colour/contr...
Vladimir Kolmogorov, Antonio Criminisi, Andrew Bla...
RECOMB
2009
Springer
15 years 10 months ago
Counting All DCJ Sorting Scenarios
In genome rearrangements, the double cut and join (DCJ) operation, introduced by Yancopoulos et al., allows to represent most rearrangement events that could happen in multichromos...
Marília D. V. Braga, Jens Stoye
PADS
2003
ACM
15 years 8 months ago
Reducing the Size of Routing Tables for Large-scale Network Simulation
In simulating large-scale networks, due to the limitation of available resources on computers, the size of the networks and the scale of simulation scenarios are often restricted....
Akihito Hiromori, Hirozumi Yamaguchi, Keiichi Yasu...
ICDM
2006
IEEE
119views Data Mining» more  ICDM 2006»
15 years 9 months ago
Fast On-line Kernel Learning for Trees
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
CIDM
2007
IEEE
15 years 7 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...