4103 search results - page 225 / 821 » Some results on the Collatz problem |
172
click to vote
FOCS
2005
IEEE
16 years 10 days ago
2005
IEEE
The problem of characterizing all the testable graph properties is considered by many to be the most important open problem in the area of property-testing. Our main result in thi...
168
click to vote
EUROGP
2007
Springer
16 years 27 days ago
2007
Springer
The ability of Genetic Programming to scale to problems of increasing difficulty operates on the premise that it is possible to capture regularities that exist in a problem environ...
196
click to vote
ESANN
2006
15 years 8 months ago
2006
Spectral classification, segmentation and data reduction are the three main problems in hyperspectral image analysis. In this paper we propose a Bayesian estimation approach which ...
166
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
A common thread in all the recent results concerning the testing of dense graphs is the use of Szemer?edi's regularity lemma. In this paper we show that in some sense this is...
178
click to vote
GLOBECOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— Given a wireless sensor network (WSN) whose sensors are randomly and independently distributed in a bounded area following a homogeneous Poisson process with density ρ and eac...