3146 search results - page 236 / 630 » Efficient Consequence Finding |
187
click to vote
UAI
1992
15 years 7 months ago
1992
In this paper, a unified framework for representing uncertain information based on the notion of an interval structure is proposed. It is shown that the lower and upper approximat...
162
click to vote
HAIS
2008
Springer
15 years 7 months ago
2008
Springer
The widespread use of artificial neural networks and the difficult work regarding the correct specification (tuning) of parameters for a given problem are the main aspects that mot...
178
click to vote
CGF
2008
15 years 6 months ago
2008
We present a spectral approach to automatically and efficiently obtain discrete free-boundary conformal parameterizations of triangle mesh patches, without the common artifacts du...
202
click to vote
CSDA
2008
15 years 6 months ago
2008
Group lasso is a natural extension of lasso and selects variables in a grouped manner. However, group lasso suffers from estimation inefficiency and selection inconsistency. To re...
166
click to vote
CC
2006
Springer
15 years 6 months ago
2006
Springer
Given a k-uniform hypergraph, the Maximum k-Set Packing problem is to find the maximum disjoint set of edges. We prove that this problem cannot be efficiently approximated to with...