Sciweavers

4354 search results - page 66 / 871
» Classification-based objective functions
Sort
View
ICML
2007
IEEE
16 years 6 months ago
On learning with dissimilarity functions
We study the problem of learning a classification task in which only a dissimilarity function of the objects is accessible. That is, data are not represented by feature vectors bu...
Liwei Wang, Cheng Yang, Jufu Feng
ICSM
2002
IEEE
15 years 11 months ago
Measuring Software Functional Size: Towards an Effective Measurement of Complexity
Data manipulation, or algorithmic complexity, is not taken into account adequately in any of the most popular functional size measurement methods. In this paper, we recall some we...
De Tran-Cao, Ghislain Lévesque, Alain Abran
CORR
2008
Springer
85views Education» more  CORR 2008»
15 years 6 months ago
Ranking and Unranking of Hereditarily Finite Functions and Permutations
Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. ranki...
Paul Tarau
IJISEC
2010
121views more  IJISEC 2010»
15 years 4 months ago
Flowchart description of security primitives for controlled physical unclonable functions
Physical Unclonable Functions (PUFs) are physical objects that are unique, practically unclonable and that behave like a random function when subjected to a challenge. Their use h...
Boris Skoric, Marc X. Makkes
ICML
2006
IEEE
16 years 6 months ago
Ranking on graph data
In ranking, one is given examples of order relationships among objects, and the goal is to learn from these examples a real-valued ranking function that induces a ranking or order...
Shivani Agarwal