Sciweavers

5849 search results - page 89 / 1170
» Predictive search distributions
Sort
View
BMCBI
2006
85views more  BMCBI 2006»
15 years 4 months ago
Searching for interpretable rules for disease mutations: a simulated annealing bump hunting strategy
Background: Understanding how amino acid substitutions affect protein functions is critical for the study of proteins and their implications in diseases. Although methods have bee...
Rui Jiang, Hua Yang, Fengzhu Sun, Ting Chen
CIKM
2005
Springer
15 years 10 months ago
Supporting ranked search in parallel search cluster networks
We investigate how to support ranked keyword search in a Parallel Search Cluster Network, which is a newly proposed peer-to-peer network overlay. In particular, we study how to eï...
Fang Xiong, Qiong Luo, Dyce Jing Zhao
FLAIRS
2007
15 years 7 months ago
Mining Sequences in Distributed Sensors Data for Energy Production
The desire to predict power generation at a given point in time is essential to power scheduling, energy trading, and availability modeling. The research conducted within is conce...
Mehmed M. Kantardzic, John Gant
PKDD
2009
Springer
149views Data Mining» more  PKDD 2009»
15 years 11 months ago
Learning to Disambiguate Search Queries from Short Sessions
Web searches tend to be short and ambiguous. It is therefore not surprising that Web query disambiguation is an actively researched topic. To provide a personalized experience for ...
Lilyana Mihalkova, Raymond J. Mooney
ICML
1994
IEEE
15 years 8 months ago
A Conservation Law for Generalization Performance
Conservation of information (COI) popularized by the no free lunch theorem is a great leveler of search algorithms, showing that on average no search outperforms any other. Yet in ...
Cullen Schaffer