Sciweavers

1816 search results - page 200 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
ATAL
2010
Springer
15 years 7 months ago
Merging example plans into generalized plans for non-deterministic environments
We present a new approach for finding generalized contingent plans with loops and branches in situations where there is uncertainty in state properties and object quantities, but ...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...
SSPR
2010
Springer
15 years 5 months ago
Large-Scale Text to Image Retrieval Using a Bayesian K-Neighborhood Model
Abstract. In this paper we introduce a new approach aimed at solving the problem of image retrieval from text queries. We propose to estimate the word relevance of an image using a...
Roberto Paredes
ICDM
2007
IEEE
187views Data Mining» more  ICDM 2007»
16 years 26 days ago
A Comparative Study of Methods for Transductive Transfer Learning
The problem of transfer learning, where information gained in one learning task is used to improve performance in another related task, is an important new area of research. While...
Andrew Arnold, Ramesh Nallapati, William W. Cohen
APPROX
2004
Springer
149views Algorithms» more  APPROX 2004»
15 years 12 months ago
Edge Coloring with Delays
Consider the following communication problem, that leads to a new notion of edge coloring. The communication network is represented by a bipartite multigraph, where the nodes on o...
Noga Alon, Vera Asodi
JMLR
2008
209views more  JMLR 2008»
15 years 6 months ago
Bayesian Inference and Optimal Design for the Sparse Linear Model
The linear model with sparsity-favouring prior on the coefficients has important applications in many different domains. In machine learning, most methods to date search for maxim...
Matthias W. Seeger