Sciweavers

2520 search results - page 327 / 504
» The complexity of approximating entropy
Sort
View
CORR
2006
Springer
109views Education» more  CORR 2006»
15 years 6 months ago
Decision Making with Side Information and Unbounded Loss Functions
We consider the problem of decision-making with side information and unbounded loss functions. Inspired by probably approximately correct learning model, we use a slightly differe...
Majid Fozunbal, Ton Kalker
IJCSA
2006
121views more  IJCSA 2006»
15 years 6 months ago
Evaluation of the RC4 Algorithm for Data Encryption
Analysis of the effect of different parameters of the RC4 encryption algorithm where examined. Some experimental work was performed to illustrate the performance of this algorithm...
Allam Mousa, Ahmad Hamad
IJCV
2006
116views more  IJCV 2006»
15 years 6 months ago
Contextual Inference in Contour-Based Stereo Correspondence
Standard approaches to stereo correspondence have difficulty when scene structure does not lie in or near the frontal parallel plane, in part because an orientation disparity as we...
Gang Li, Steven W. Zucker
JMLR
2008
133views more  JMLR 2008»
15 years 6 months ago
Algorithms for Sparse Linear Classifiers in the Massive Data Setting
Classifiers favoring sparse solutions, such as support vector machines, relevance vector machines, LASSO-regression based classifiers, etc., provide competitive methods for classi...
Suhrid Balakrishnan, David Madigan
EOR
2007
84views more  EOR 2007»
15 years 6 months ago
The multi-layered network design problem
act 11 We address the problem of designing a network built on several layers. This problem occurs in practical applications 12 but has not been studied extensively from the point o...
Arnaud Knippel, Benoit Lardeux