Sciweavers

20441 search results - page 258 / 4089
» Locally Computable Structures
Sort
View
APAL
2010
85views more  APAL 2010»
15 years 4 months ago
Elementary differences between the degrees of unsolvability and degrees of compressibility
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
George Barmpalias
AISB
1994
Springer
15 years 8 months ago
Formal Memetic Algorithms
Abstract. A formal, representation-independent form of a memetic algorithm-a genetic algorithm incorporating local search--is introduced. A generalisedform of N-point crossover is ...
Nicholas J. Radcliffe, Patrick D. Surry
ECCV
2006
Springer
16 years 6 months ago
Retexturing Single Views Using Texture and Shading
We present a method for retexturing non-rigid objects from a single viewpoint. Without reconstructing 3D geometry, we create realistic video with shape cues at two scales. At a coa...
Ryan White, David A. Forsyth
AINA
2006
IEEE
15 years 10 months ago
Sequential Localization Algorithm for Active Sensor Network Deployment
There has been a lot of work on localization for sensor networks. Most localization schemes assume an already deployed network. Very little research has been done for active senso...
Ying Zhang, Qingfeng Huang, Juan Liu
ADHOCNOW
2004
Springer
15 years 9 months ago
Weathering the Storm: Managing Redundancy and Security in Ad Hoc Networks
Many ad hoc routing algorithms rely on broadcast flooding for location discovery or more generally for secure routing applications, particularly when dealing with Byzantine threat...
Mike Burmester, Tri Van Le, Alec Yasinsac