Sciweavers

2790 search results - page 120 / 558
» A generative theory of relevance
Sort
View
FOCS
2009
IEEE
16 years 1 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
GECCO
2005
Springer
232views Optimization» more  GECCO 2005»
16 years 13 min ago
Factorial representations to generate arbitrary search distributions
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
Marc Toussaint
ICCS
2005
Springer
15 years 12 months ago
Merge-Based Computation of Minimal Generators
Abstract. Minimal generators (mingens) of concept intents are valuable elements of the Formal Concept Analysis (FCA) landscape, which are widely used in the database field, for da...
Céline Frambourg, Petko Valtchev, Robert Go...
ICFCA
2005
Springer
15 years 12 months ago
On Computing the Minimal Generator Family for Concept Lattices and Icebergs
Minimal generators (or mingen) constitute a remarkable part of the closure space landscape since they are the antipodes of the closures, i.e., minimal sets in the underlying equiva...
Kamal Nehmé, Petko Valtchev, Mohamed Rouane...
IUI
2004
ACM
15 years 12 months ago
SUPPLE: automatically generating user interfaces
In order to give people ubiquitous access to software applications, device controllers, and Internet services, it will be necessary to automatically adapt user interfaces to the c...
Krzysztof Gajos, Daniel S. Weld