Sciweavers

4007 search results - page 700 / 802
» Computation with imprecise probabilities
Sort
View
MOBICOM
2010
ACM
13 years 9 months ago
Privacy vulnerability of published anonymous mobility traces
Mobility traces of people and vehicles have been collected and published to assist the design and evaluation of mobile networks, such as large-scale urban sensing networks. Althou...
Chris Y. T. Ma, David K. Y. Yau, Nung Kwan Yip, Na...
BMCBI
2008
95views more  BMCBI 2008»
13 years 9 months ago
PURE: A webserver for the prediction of domains in unassigned regions in proteins
Background: Protein domains are the structural and functional units of proteins. The ability to parse proteins into different domains is important for effective classification, un...
Chilamakuri C. S. Reddy, Khader Shameer, Bernard O...
CORR
2010
Springer
170views Education» more  CORR 2010»
13 years 9 months ago
Slow Adaptive OFDMA Systems Through Chance Constrained Programming
Adaptive orthogonal frequency division multiple access (OFDMA) has recently been recognized as a promising technique for providing high spectral efficiency in future broadband wire...
William Weiliang Li, Ying Jun Zhang, Anthony Man-C...
ML
2008
ACM
248views Machine Learning» more  ML 2008»
13 years 9 months ago
Feature selection via sensitivity analysis of SVM probabilistic outputs
Feature selection is an important aspect of solving data-mining and machine-learning problems. This paper proposes a feature-selection method for the Support Vector Machine (SVM) l...
Kai Quan Shen, Chong Jin Ong, Xiao Ping Li, Einar ...
AI
2002
Springer
13 years 8 months ago
Improving heuristic mini-max search by supervised learning
This article surveys three techniques for enhancing heuristic game-tree search pioneered in the author's Othello program Logistello, which dominated the computer Othello scen...
Michael Buro