Sciweavers

1550 search results - page 121 / 310
» Optimizing search by showing results in context
Sort
View
ISCI
2008
102views more  ISCI 2008»
13 years 9 months ago
Random walk biclustering for microarray data
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rand...
Fabrizio Angiulli, Eugenio Cesario, Clara Pizzuti
IPM
2007
123views more  IPM 2007»
13 years 9 months ago
Using query logs to establish vocabularies in distributed information retrieval
Users of search engines express their needs as queries, typically consisting of a small number of terms. The resulting search engine query logs are valuable resources that can be ...
Milad Shokouhi, Justin Zobel, Seyed M. M. Tahaghog...
AROBOTS
2000
108views more  AROBOTS 2000»
13 years 9 months ago
Robot Awareness in Cooperative Mobile Robot Learning
Most of the straight-forward learning approaches in cooperative robotics imply for each learning robot a state space growth exponential in the number of team members. To remedy the...
Claude F. Touzet
UAI
2003
13 years 10 months ago
On Local Optima in Learning Bayesian Networks
This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that i...
Jens D. Nielsen, Tomás Kocka, José M...
ICCV
2009
IEEE
15 years 2 months ago
A Theory of Active Object Localization
We present some theoretical results related to the problem of actively searching for a target in a 3D environment, under the constraint of a maximum search time. We define the o...
Alexander Andreopoulos, John K. Tsotsos