Sciweavers

2168 search results - page 375 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
BMCBI
2007
217views more  BMCBI 2007»
15 years 2 months ago
On consensus biomarker selection
Background: Recent development of mass spectrometry technology enabled the analysis of complex peptide mixtures. A lot of effort is currently devoted to the identification of biom...
Janusz Dutkowski, Anna Gambin
CORR
2010
Springer
105views Education» more  CORR 2010»
14 years 10 months ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...
WWW
2009
ACM
16 years 3 months ago
Bid optimization for broad match ad auctions
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...
JACM
2010
120views more  JACM 2010»
14 years 9 months ago
The structure of inverses in schema mappings
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...
Ronald Fagin, Alan Nash
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
16 years 3 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...