Sciweavers

1998 search results - page 356 / 400
» Complexity of the Cover Polynomial
Sort
View
JCSS
2008
138views more  JCSS 2008»
13 years 10 months ago
Reducing mechanism design to algorithm design via machine learning
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
Maria-Florina Balcan, Avrim Blum, Jason D. Hartlin...
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
13 years 9 months ago
Near-optimal algorithms for shared filter evaluation in data stream systems
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
BMCBI
2004
144views more  BMCBI 2004»
13 years 9 months ago
PASBio: predicate-argument structures for event extraction in molecular biology
Background: The exploitation of information extraction (IE), a technology aiming to provide instances of structured representations from free-form text, has been rapidly growing w...
Tuangthong Wattarujeekrit, Parantu K. Shah, Nigel ...
NAR
1998
150views more  NAR 1998»
13 years 9 months ago
PROMISE: a database of information on prosthetic centres and metal ions in protein active sites
The PROMISE (Prosthetic centres and metal ions in protein active sites) database aims to gather together comprehensive sequence, structural, functional and bibliographic informati...
Kirill Degtyarenko, A. C. North, D. N. Perkins, Jo...
BMCBI
2010
193views more  BMCBI 2010»
13 years 5 months ago
Mayday - integrative analytics for expression data
Background: DNA Microarrays have become the standard method for large scale analyses of gene expression and epigenomics. The increasing complexity and inherent noisiness of the ge...
Florian Battke, Stephan Symons, Kay Nieselt