Sciweavers

2107 search results - page 317 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
CAV
2010
Springer
172views Hardware» more  CAV 2010»
14 years 1 months ago
Symbolic Bounded Synthesis
Abstract. Synthesis of finite state systems from full linear time temporal logic (LTL) specifications is gaining more and more attention as several recent achievements have signi...
Rüdiger Ehlers
LICS
1998
IEEE
14 years 20 days ago
Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
Eugene W. Stark, Scott A. Smolka
HIS
2004
13 years 10 months ago
Adaptive Boosting with Leader based Learners for Classification of Large Handwritten Data
Boosting is a general method for improving the accuracy of a learning algorithm. AdaBoost, short form for Adaptive Boosting method, consists of repeated use of a weak or a base le...
T. Ravindra Babu, M. Narasimha Murty, Vijay K. Agr...
CORR
2008
Springer
83views Education» more  CORR 2008»
13 years 9 months ago
Resource Allocation in Multiple Access Channels
We consider the problem of rate allocation in a Gaussian multiple-access channel, with the goal of maximizing a utility function over transmission rates. In contrast to the literat...
Ali ParandehGheibi, Atilla Eryilmaz, Asuman E. Ozd...
NN
2007
Springer
106views Neural Networks» more  NN 2007»
13 years 8 months ago
Machine learning approach to color constancy
A number of machine learning (ML) techniques have recently been proposed to solve color constancy problem in computer vision. Neural networks (NNs) and support vector regression (...
Vivek Agarwal, Andrei V. Gribok, Mongi A. Abidi