Sciweavers

3244 search results - page 19 / 649
» On convex complexity measures
Sort
View
BMVC
2000
15 years 18 days ago
Object Recognition using the Invariant Pixel-Set Signature
A new object recognition method, the Invariant Pixel Set Signature (IPSS), is introduced. Objects are represented with a probability density on the space of invariants computed fr...
Jiri Matas, J. Burianek, Josef Kittler
DCG
2008
93views more  DCG 2008»
14 years 11 months ago
Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings
Let S be the boundary of a convex polytope of dimension d + 1, or more generally let S be a convex polyhedral pseudomanifold. We prove that S has a polyhedral nonoverlapping unfold...
Ezra Miller, Igor Pak
ICSE
2010
IEEE-ACM
15 years 1 months ago
Measuring complexity, effectiveness and efficiency in software course projects
This paper discusses results achieved in measuring complexity, effectiveness and efficiency, in a series of related software course projects, spanning a period of seven years. We ...
Wilson Padua
JC
2007
96views more  JC 2007»
14 years 11 months ago
Error linear complexity measures for multisequences
Complexity measures for sequences over finite fields, such as the linear complexity and the k-error linear complexity, play an important role in cryptology. Recent developments ...
Wilfried Meidl, Harald Niederreiter, Ayineedi Venk...
CIARP
2005
Springer
15 years 4 months ago
Classifier Selection Based on Data Complexity Measures
Tin Kam Ho and Ester Bernardò Mansilla in 2004 proposed to use data complexity measures to determine the domain of competition of the classifiers. They applied different classifie...
Edith Hernández-Reyes, Jesús Ariel C...