Sciweavers

1871 search results - page 278 / 375
» Selecting for evolvable representations
Sort
View
WWW
2007
ACM
14 years 8 months ago
Query-driven indexing for peer-to-peer text retrieval
We describe a query-driven indexing framework for scalable text retrieval over structured P2P networks. To cope with the bandwidth consumption problem that has been identified as ...
Gleb Skobeltsyn, Toan Luu, Karl Aberer, Martin Raj...
KDD
2009
ACM
223views Data Mining» more  KDD 2009»
14 years 8 months ago
Collaborative filtering with temporal dynamics
Customer preferences for products are drifting over time. Product perception and popularity are constantly changing as new selection emerges. Similarly, customer inclinations are ...
Yehuda Koren
KDD
2004
ACM
196views Data Mining» more  KDD 2004»
14 years 8 months ago
Adversarial classification
Essentially all data mining algorithms assume that the datagenerating process is independent of the data miner's activities. However, in many domains, including spam detectio...
Nilesh N. Dalvi, Pedro Domingos, Mausam, Sumit K. ...
RECOMB
2005
Springer
14 years 8 months ago
Very Low Power to Detect Asymmetric Divergence of Duplicated Genes
Abstract. Asymmetric functional divergence of paralogues is a key aspect of the traditional model of evolution following duplication. If one gene continues to perform the ancestral...
Cathal Seoighe, Konrad Scheffler
AOSD
2010
ACM
14 years 2 months ago
Tracking code patterns over multiple software versions with Herodotos
An important element of understanding a software code base is to identify the repetitive patterns of code it contains and how these evolve over time. Some patterns are useful to t...
Nicolas Palix, Julia L. Lawall, Gilles Muller