Sciweavers

840 search results - page 73 / 168
» The Complexity of the Extended GCD Problem
Sort
View
BMCBI
2007
158views more  BMCBI 2007»
13 years 8 months ago
Penalized likelihood for sparse contingency tables with an application to full-length cDNA libraries
Background: The joint analysis of several categorical variables is a common task in many areas of biology, and is becoming central to systems biology investigations whose goal is ...
Corinne Dahinden, Giovanni Parmigiani, Mark C. Eme...
ICDE
2009
IEEE
120views Database» more  ICDE 2009»
14 years 9 months ago
Weighted Proximity Best-Joins for Information Retrieval
We consider the problem of efficiently computing weighted proximity best-joins over multiple lists, with applications in information retrieval and extraction. We are given a multi-...
AnHai Doan, Haixun Wang, Hao He, Jun Yang 0001, Ri...
ICML
2000
IEEE
14 years 8 months ago
Version Space Algebra and its Application to Programming by Demonstration
Machine learning research has been very successful at producing powerful, broadlyapplicable classification learners. However, many practical learning problems do not fit the class...
Tessa A. Lau, Pedro Domingos, Daniel S. Weld
STOC
2005
ACM
142views Algorithms» more  STOC 2005»
14 years 8 months ago
Market equilibrium via the excess demand function
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...
Bruno Codenotti, Benton McCune, Kasturi R. Varadar...
PODS
2005
ACM
129views Database» more  PODS 2005»
14 years 8 months ago
Regular rewriting of active XML and unambiguity
We consider here the exchange of Active XML (AXML) data, i.e., XML documents where some of the data is given explicitly while other parts are given only intensionally as calls to ...
Serge Abiteboul, Tova Milo, Omar Benjelloun