Sciweavers

1529 search results - page 204 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
GECCO
2005
Springer
15 years 9 months ago
Theme preservation and the evolution of representation
The identification of mechanisms by which constraints on phenotypic variability are tuned in nature, and the implementation of these mechanisms in Evolutionary Algorithms (EAs) ca...
Keki M. Burjorjee, Jordan B. Pollack
CORR
2007
Springer
104views Education» more  CORR 2007»
15 years 4 months ago
Sorting and Selection in Posets
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
Constantinos Daskalakis, Richard M. Karp, Elchanan...
ECCV
2002
Springer
16 years 6 months ago
Constructing Illumination Image Basis from Object Motion
We propose to construct a 3D linear image basis which spans an image space of arbitrary illumination conditions, from images of a moving object observed under a static lighting con...
Akiko Nakashima, Atsuto Maki, Kazuhiro Fukui
ICML
2007
IEEE
16 years 4 months ago
Efficiently computing minimax expected-size confidence regions
Given observed data and a collection of parameterized candidate models, a 1- confidence region in parameter space provides useful insight as to those models which are a good fit t...
Brent Bryan, H. Brendan McMahan, Chad M. Schafer, ...
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
15 years 10 months ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan