Sciweavers

4698 search results - page 72 / 940
» Making Functionality More General
Sort
View
ISMVL
1997
IEEE
82views Hardware» more  ISMVL 1997»
15 years 7 months ago
Finding Composition Trees for Multiple-Valued Functions
The composition tree of a given function, when it exists, provides a representation of the function revealing all possible disjunctive decompositions, thereby suggesting a realiza...
Elena Dubrova, Jon C. Muzio, Bernhard von Stengel
130
Voted
IUI
2009
ACM
16 years 1 days ago
Learning to generalize for complex selection tasks
Selection tasks are common in modern computer interfaces: we are often required to select a set of files, emails, data entries, and the like. File and data browsers have sorting a...
Alan Ritter, Sumit Basu
ICDM
2008
IEEE
97views Data Mining» more  ICDM 2008»
15 years 9 months ago
Semi-supervised Learning from General Unlabeled Data
We consider the problem of Semi-supervised Learning (SSL) from general unlabeled data, which may contain irrelevant samples. Within the binary setting, our model manages to better...
Kaizhu Huang, Zenglin Xu, Irwin King, Michael R. L...
CVPR
2012
IEEE
13 years 5 months ago
A tiered move-making algorithm for general pairwise MRFs
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr
FS
2006
102views more  FS 2006»
15 years 3 months ago
Bounds for Functions of Dependent Risks
Abstract The problem of finding the best-possible lower bound on the distribution of a non-decreasing function of n dependent risks is solved when n = 2 and a lower bound on the co...
Paul Embrechts, Giovanni Puccetti