Sciweavers

329 search results - page 16 / 66
» A note on the Hopf-Stiefel function
Sort
View
WWW
2011
ACM
13 years 3 months ago
Learning to rank with multiple objective functions
We investigate the problem of learning to rank for document retrieval from the perspective of learning with multiple objective functions. We present solutions to two open problems...
Krysta Marie Svore, Maksims Volkovs, Christopher J...
CHI
2006
ACM
14 years 9 months ago
Because I carry my cell phone anyway: functional location-based reminder applications
Although they have potential, to date location-based information systems have not radically improved the way we interact with our surroundings. To study related issues, we develop...
Pamela J. Ludford, Dan Frankowski, Ken Reily, Kurt...
CEC
2005
IEEE
13 years 10 months ago
A note on the population based incremental learning with infinite population size
In this paper, we study the dynamical properties of the population based incremental learning (PBIL) algorithm when it uses truncation, proportional, and Boltzmann selection schema...
Reza Rastegar, Mohammad Reza Meybodi
CORR
2007
Springer
100views Education» more  CORR 2007»
13 years 8 months ago
The Haar Wavelet Transform of a Dendrogram: Additional Notes
We consider the wavelet transform of a finite, rooted, node-ranked, p-way tree, focusing on the case of binary (p = 2) trees. We study a Haar wavelet transform on this tree. Wave...
Fionn Murtagh
CORR
2007
Springer
113views Education» more  CORR 2007»
13 years 8 months ago
Note on edge-colored graphs and digraphs without properly colored cycles
We study the following two functions: d(n, c) and d(n, c); d(n, c) (d(n, c)) is the minimum number k such that every c-edge-colored undirected (directed) graph of order n and mini...
Gregory Gutin