Sciweavers

1576 search results - page 303 / 316
» Properties of Synthetic Optimization Problems
Sort
View
109
Voted
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
16 years 2 days ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
97
Voted
EDBT
2002
ACM
141views Database» more  EDBT 2002»
15 years 11 months ago
Efficient OLAP Query Processing in Distributed Data Warehouses
Abstract. The success of Internet applications has led to an explosive growth in the demand for bandwidth from ISPs. Managing an IP network requires collecting and analyzing networ...
Michael O. Akinde, Michael H. Böhlen, Theodor...
113
Voted
RECOMB
2009
Springer
15 years 6 months ago
Protein Fragment Swapping: A Method for Asymmetric, Selective Site-Directed Recombination
This paper presents a new approach to site-directed recombination, swapping combinations of selected discontiguous fragments from a source protein in place of corresponding fragmen...
Wei Zheng, Karl E. Griswold, Chris Bailey-Kellogg
ICC
2009
IEEE
176views Communications» more  ICC 2009»
15 years 6 months ago
Error Resilient Non-Asymmetric Slepian-Wolf Coding
Abstract—We consider non-asymmetric distributed source coding (DSC) that achieves any point in the Slepian-Wolf (SW) region. We study the error propagation phenomena and propose ...
Cédric Herzet, Velotiaray Toto-Zarasoa, Ali...
111
Voted
AMAI
2004
Springer
15 years 5 months ago
A Framework for Sequential Planning in Multi-Agent Settings
This paper extends the framework of partially observable Markov decision processes (POMDPs) to multi-agent settings by incorporating the notion of agent models into the state spac...
Piotr J. Gmytrasiewicz, Prashant Doshi