Sciweavers

128 search results - page 21 / 26
» Comparison of microarray designs for class comparison and cl...
Sort
View
ICCAD
1994
IEEE
134views Hardware» more  ICCAD 1994»
13 years 11 months ago
Boolean constrained encoding: a new formulation and a case study
1 This paper provides a new, generalized approach to the problem of encoding information as vectors of binary digits. We furnish a formal definition for the Boolean constrained enc...
Ney Laert Vilar Calazans
ACSAC
2006
IEEE
13 years 11 months ago
On Detecting Camouflaging Worm
Active worms pose major security threats to the Internet. In this paper, we investigate a new class of active worms, i.e., Camouflaging Worm (C-Worm in short). The C-Worm has the ...
Wei Yu, Xun Wang, Prasad Calyam, Dong Xuan, Wei Zh...
ESWA
2006
105views more  ESWA 2006»
13 years 7 months ago
Predicting box-office success of motion pictures with neural networks
Predicting box-office receipts of a particular motion picture has intrigued many scholars and industry leaders as a difficult and challenging problem. In this study, the use of ne...
Ramesh Sharda, Dursun Delen
JPDC
2008
122views more  JPDC 2008»
13 years 7 months ago
Stochastic robustness metric and its use for static resource allocations
This research investigates the problem of robust static resource allocation for distributed computing systems operating under imposed Quality of Service (QoS) constraints. Often, ...
Vladimir Shestak, Jay Smith, Anthony A. Maciejewsk...
ECCV
2010
Springer
13 years 4 months ago
An Efficient Graph Cut Algorithm for Computer Vision Problems
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
Chetan Arora, Subhashis Banerjee, Prem Kalra, S. N...