Sciweavers

472 search results - page 56 / 95
» Limiting Negations in Formulas
Sort
View
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
14 years 3 months ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm
KDD
2000
ACM
162views Data Mining» more  KDD 2000»
14 years 1 months ago
Data Mining from Functional Brain Images
Recent advances in functional brain imaging enable identication of active areas of a brain performing a certain function. Induction of logical formulas describing relations betwee...
Mitsuru Kakimoto, Chie Morita, Yoshiaki Kikuchi, H...
BMCBI
2007
185views more  BMCBI 2007»
13 years 10 months ago
GEDI: a user-friendly toolbox for analysis of large-scale gene expression data
Background: Several mathematical and statistical methods have been proposed in the last few years to analyze microarray data. Most of those methods involve complicated formulas, a...
André Fujita, João Ricardo Sato, Car...
CORR
2006
Springer
132views Education» more  CORR 2006»
13 years 10 months ago
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...
Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. ...
ML
1998
ACM
131views Machine Learning» more  ML 1998»
13 years 10 months ago
Learning from Examples and Membership Queries with Structured Determinations
It is well known that prior knowledge or bias can speed up learning, at least in theory. It has proved di cult to make constructive use of prior knowledge, so that approximately c...
Prasad Tadepalli, Stuart J. Russell