Sciweavers

1684 search results - page 10 / 337
» The lexicographic decision function
Sort
View
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
13 years 12 months ago
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Rafi Heiman, Avi Wigderson
ICDM
2006
IEEE
151views Data Mining» more  ICDM 2006»
14 years 2 months ago
Decision Trees for Functional Variables
Classification problems with functionally structured input variables arise naturally in many applications. In a clinical domain, for example, input variables could include a time...
Suhrid Balakrishnan, David Madigan
ICASSP
2011
IEEE
13 years 4 days ago
A novel decision function and the associated decision-feedback learning for speech translation
In this paper we report our recent development of an end-to-end integrative design methodology for speech translation. Specifically, a novel decision function is proposed based o...
Yaodong Zhang, Li Deng, Xiaodong He, Alex Acero
CORR
2008
Springer
156views Education» more  CORR 2008»
13 years 8 months ago
Pairing Functions, Boolean Evaluation and Binary Decision Diagrams
A "pairing function" J associates a unique natural number z to any two natural numbers x,y such that for two "unpairing functions" K and L, the equalities K(J(x...
Paul Tarau