Sciweavers

8413 search results - page 235 / 1683
» Ordering Problem Subgoals
Sort
View
96
Voted
ORL
2008
116views more  ORL 2008»
15 years 22 days ago
Explicit gradient information in multiobjective optimization
This paper presents an algorithm that converges to points that satisfy a first order necessary condition of weakly Pareto solutions of multiobjective optimization problems. Hints ...
Ubaldo M. García-Palomares, Juan C. Burguil...
108
Voted
CAGD
2010
215views more  CAGD 2010»
15 years 27 days ago
Surface fitting and registration of point clouds using approximations of the unsigned distance function
Many problems in computer aided geometric design and geometry processing are stated as least
Simon Flöry, Michael Hofer
96
Voted
JMLR
2010
115views more  JMLR 2010»
14 years 7 months ago
Bayesian structure discovery in Bayesian networks with less space
Current exact algorithms for score-based structure discovery in Bayesian networks on n nodes run in time and space within a polynomial factor of 2n . For practical use, the space ...
Pekka Parviainen, Mikko Koivisto
125
Voted
JMLR
2010
149views more  JMLR 2010»
14 years 7 months ago
Fast Committee-Based Structure Learning
Current methods for causal structure learning tend to be computationally intensive or intractable for large datasets. Some recent approaches have speeded up the process by first m...
Ernest Mwebaze, John A. Quinn
ICASSP
2011
IEEE
14 years 4 months ago
Optimal power allocation and joint source-channel coding for wireless DS-CDMA visual sensor networks using the Nash Bargaining S
We consider the problem of resource allocation for a Direct Sequence Code Division Multiple Access (DS-CDMA) wireless visual sensor network (VSN). We use the Nash Bargaining Solut...
Katerina Pandremmenou, Lisimachos P. Kondi, Konsta...