Sciweavers

1101 search results - page 80 / 221
» Comparing Computer Models Solving Number Series Problems
Sort
View
FIMI
2004
239views Data Mining» more  FIMI 2004»
14 years 11 months ago
LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets
: For a transaction database, a frequent itemset is an itemset included in at least a specified number of transactions. A frequent itemset P is maximal if P is included in no other...
Takeaki Uno, Masashi Kiyomi, Hiroki Arimura
VTC
2006
IEEE
112views Communications» more  VTC 2006»
15 years 3 months ago
Adaptive Resource Allocation Based on Channel Information in Multihop OFDM Systems
— In this paper, we investigate the adaptive resource allocation problem in multiuser multihop OFDM systems. Assuming that base station(BS) knows all channel information, we form...
ChiSung Bae, Dong-Ho Cho
COR
2007
134views more  COR 2007»
14 years 9 months ago
Portfolio selection using neural networks
In this paper we apply a heuristic method based on artificial neural networks (NN) in order to trace out the efficient frontier associated to the portfolio selection problem. We...
Alberto Fernández, Sergio Gómez
ICRA
2010
IEEE
132views Robotics» more  ICRA 2010»
14 years 8 months ago
Sampling-based motion planning with temporal goals
Abstract— This paper presents a geometry-based, multilayered synergistic approach to solve motion planning problems for mobile robots involving temporal goals. The temporal goals...
Amit Bhatia, Lydia E. Kavraki, Moshe Y. Vardi
INFFUS
2011
82views more  INFFUS 2011»
14 years 1 months ago
Joint ego-motion and road geometry estimation
We provide a sensor fusion framework for solving the problem of joint ego-motion and road geometry estimation. More specifically we employ a sensor fusion framework to make syste...
Christian Lundquist, Thomas B. Schön