Sciweavers

4965 search results - page 22 / 993
» A Simple Abstraction for Data Modeling
Sort
View
ICPR
2006
IEEE
15 years 11 months ago
Competitive Mixtures of Simple Neurons
We propose a competitive finite mixture of neurons (or perceptrons) for solving binary classification problems. Our classifier includes a prior for the weights between different n...
Karthik Sridharan, Matthew J. Beal, Venu Govindara...
CEC
2005
IEEE
15 years 3 months ago
A simple hybrid evolutionary algorithm for finding Golomb rulers
Abstract- Finding Golomb rulers is an extremely challenging optimization problem (with many practical applications) that has been approached by a variety of search methods in recen...
Iván Dotú, Pascal Van Hentenryck
82
Voted
INFOCOM
2009
IEEE
15 years 4 months ago
Absence of Evidence as Evidence of Absence: A Simple Mechanism for Scalable P2P Search
Abstract—We propose a novel search mechanism for unstructured p2p networks, and show that it is both scalable, i.e., it leads to a bounded query traffic load per peer as the pee...
Stratis Ioannidis, Peter Marbach
MDM
2007
Springer
137views Communications» more  MDM 2007»
15 years 4 months ago
Infrastructure for Data Processing in Large-Scale Interconnected Sensor Networks
Abstract—With the price of wireless sensor technologies diminishing rapidly we can expect large numbers of autonomous sensor networks being deployed in the near future. These sen...
Karl Aberer, Manfred Hauswirth, Ali Salehi
76
Voted
ANNPR
2006
Springer
15 years 1 months ago
Simple and Effective Connectionist Nonparametric Estimation of Probability Density Functions
Abstract. Estimation of probability density functions (pdf) is one major topic in pattern recognition. Parametric techniques rely on an arbitrary assumption on the form of the unde...
Edmondo Trentin