Sciweavers

338 search results - page 47 / 68
» Effective Lower Bounding Techniques for Pseudo-Boolean Optim...
Sort
View
ICLP
1997
Springer
14 years 1 days ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
TCOM
2008
151views more  TCOM 2008»
13 years 7 months ago
Low complexity MIMO scheduling with channel decomposition using capacity upperbound
Abstract In multiuser MIMO systems, the base station schedules transmissions to a group of users simultaneously. Since the data transmitted to each user are different, in order to ...
Xiaojie Zhang, Jungwoo Lee
ICITS
2009
13 years 5 months ago
Linear Threshold Multisecret Sharing Schemes
In a multisecret sharing scheme, several secret values are distributed among a set of n users, and each secret may have a different associated access structure. We consider here un...
Oriol Farràs, Ignacio Gracia, Sebasti&agrav...
EUROSYS
2011
ACM
12 years 11 months ago
Symbolic crosschecking of floating-point and SIMD code
We present an effective technique for crosschecking an IEEE 754 floating-point program and its SIMD-vectorized version, implemented in KLEE-FP, an extension to the KLEE symbolic ...
Peter Collingbourne, Cristian Cadar, Paul H. J. Ke...
PAMI
2002
106views more  PAMI 2002»
13 years 7 months ago
Performance Evaluation of Some Clustering Algorithms and Validity Indices
In this article, we evaluate the performance of three clustering algorithms, hard K-Means, single linkage, and a simulated annealing (SA) based technique, in conjunction with four ...
Ujjwal Maulik, Sanghamitra Bandyopadhyay