Sciweavers

1225 search results - page 10 / 245
» Maximal Consistent Subsets
Sort
View
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
13 years 7 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...
ESWA
2008
223views more  ESWA 2008»
13 years 7 months ago
Credit risk assessment with a multistage neural network ensemble learning approach
In this study, a multistage neural network ensemble learning model is proposed to evaluate credit risk at the measurement level. The proposed model consists of six stages. In the ...
Lean Yu, Shouyang Wang, Kin Keung Lai
CVPR
2007
IEEE
14 years 9 months ago
Efficiently Determining Silhouette Consistency
Volume intersection is a frequently used technique to solve the Shape-From-Silhouette problem, which constructs a 3D object estimate from a set of silhouettes taken with calibrate...
Li Yi, David W. Jacobs
SC
1995
ACM
13 years 11 months ago
Parallelizing the Phylogeny Problem
The problem of determining the evolutionary history of species in the form of phylogenetic trees is known as the phylogeny problem. We present a parallelization of the character c...
Jeff A. Jones, Katherine A. Yelick
ENTCS
2006
133views more  ENTCS 2006»
13 years 7 months ago
Linking Semantic Models to Support CSP || B Consistency Checking
Consistency checking in the CSP B approach verifies that an individual controller process, defined using a sequential non-divergent subset of CSP, never calls a B operation outsid...
Neil Evans, Helen Treharne