Sciweavers

321 search results - page 2 / 65
» Comparison of Additive Trees Using Circular Orders
Sort
View
ICIP
2010
IEEE
13 years 3 months ago
Comparison of merging orders and pruning strategies for Binary Partition Tree in hyperspectral data
Hyperspectral imaging segmentation has been an active research area over the past few years. Despite the growing interest, some factors such as high spectrum variability are still...
Silvia Valero, Philippe Salembier, Jocelyn Chanuss...
ICALP
2001
Springer
13 years 10 months ago
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
Peter Høyer, Jan Neerbek, Yaoyun Shi
NAR
2008
87views more  NAR 2008»
13 years 5 months ago
The CGView Server: a comparative genomics tool for circular genomes
The CGView Server generates graphical maps of circular genomes that show sequence features, base composition plots, analysis results and sequence similarity plots. Sequences can b...
Jason R. Grant, Paul Stothard
CAD
2006
Springer
13 years 5 months ago
Approximating curves and their offsets using biarcs and Pythagorean hodograph quintics
This paper compares two techniques for the approximation of the offsets to a given planar curve. The two methods are based on approximate conversion of the planar curve into circu...
Zbynek Sír, Robert Feichtinger, Bert Jü...
ECML
2005
Springer
13 years 11 months ago
A Comparison of Approaches for Learning Probability Trees
Probability trees (or Probability Estimation Trees, PET’s) are decision trees with probability distributions in the leaves. Several alternative approaches for learning probabilit...
Daan Fierens, Jan Ramon, Hendrik Blockeel, Maurice...