Sciweavers

7228 search results - page 1015 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
ICALP
2011
Springer
14 years 8 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli
ICC
2011
IEEE
215views Communications» more  ICC 2011»
14 years 4 months ago
Optimal Packet Scheduling in a Broadcast Channel with an Energy Harvesting Transmitter
—In this paper, we investigate the transmission completion time minimization problem in a two-user additive white Gaussian noise (AWGN) broadcast channel, where the transmitter i...
Jing Yang, Omur Ozel, Sennur Ulukus
158
Voted
TEC
2012
195views Formal Methods» more  TEC 2012»
13 years 7 months ago
The Effects of Constant and Bit-Wise Neutrality on Problem Hardness, Fitness Distance Correlation and Phenotypic Mutation Rates
Kimura’s neutral theory of evolution has inspired researchers from the evolutionary computation community to incorporate neutrality into Evolutionary Algorithms (EAs) in the hop...
Riccardo Poli, Edgar Galván López
ICIP
2003
IEEE
16 years 6 months ago
Statistical learning for effective visual information retrieval
For effective retrieval of visual information, statistical learning plays a pivotal role. Statistical learning in such a context faces at least two major mathematical challenges: ...
Edward Y. Chang, Beitao Li, Gang Wu, Kingshy Goh
DAC
2004
ACM
16 years 5 months ago
Security as a new dimension in embedded system design
The growing number of instances of breaches in information security in the last few years has created a compelling case for efforts towards secure electronic systems. Embedded sys...
Srivaths Ravi, Paul C. Kocher, Ruby B. Lee, Gary M...
« Prev « First page 1015 / 1446 Last » Next »