Sciweavers

680 search results - page 56 / 136
» Computational Complexity and Anytime Algorithm for Inconsist...
Sort
View
PAM
2009
Springer
14 years 2 months ago
Access Point Localization Using Local Signal Strength Gradient
Abstract. Many previous studies have examined the placement of access points (APs) to improve the community’s understanding of the deployment and behavioral characteristics of wi...
Dongsu Han, David G. Andersen, Michael Kaminsky, K...
FGCS
2007
160views more  FGCS 2007»
13 years 7 months ago
Distributed data mining in grid computing environments
The computing-intensive data mining for inherently Internet-wide distributed data, referred to as Distributed Data Mining (DDM), calls for the support of a powerful Grid with an e...
Ping Luo, Kevin Lü, Zhongzhi Shi, Qing He
PAMI
2006
229views more  PAMI 2006»
13 years 7 months ago
A Coherent Computational Approach to Model Bottom-Up Visual Attention
Visual attention is a mechanism which filters out redundant visual information and detects the most relevant parts of our visual field. Automatic determination of the most visually...
Olivier Le Meur, Patrick Le Callet, Dominique Barb...
BMCBI
2006
201views more  BMCBI 2006»
13 years 8 months ago
Gene selection algorithms for microarray data based on least squares support vector machine
Background: In discriminant analysis of microarray data, usually a small number of samples are expressed by a large number of genes. It is not only difficult but also unnecessary ...
E. Ke Tang, Ponnuthurai N. Suganthan, Xin Yao
CVPR
2005
IEEE
14 years 10 months ago
Optimal Point Correspondence through the Use of Rank Constraints
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...
João Costeira, João Xavier, Ricardo ...