Sciweavers

828 search results - page 129 / 166
» Bounded Hairpin Completion
Sort
View
IR
2008
13 years 10 months ago
Output-sensitive autocompletion search
We consider the following autocompletion search scenario: imagine a user of a search engine typing a query; then with every keystroke display those completions of the last query wo...
Holger Bast, Christian Worm Mortensen, Ingmar Webe...
COMCOM
2007
99views more  COMCOM 2007»
13 years 10 months ago
Topology-aware overlay path probing
Path probing is essential to maintaining an efficient overlay network topology. However, the cost of a full-scale probing is as high as O(n2 ), which is prohibitive in large-scale...
Chiping Tang, Philip K. McKinley
IJFCS
2006
77views more  IJFCS 2006»
13 years 10 months ago
Spike Trains in Spiking Neural P Systems
We continue here the study of the recently introduced spiking neural P systems, which mimic the way that neurons communicate with each other by means of short electrical impulses, ...
Gheorghe Paun, Mario J. Pérez-Jiméne...
IVC
2008
138views more  IVC 2008»
13 years 10 months ago
Reconstructing relief surfaces
This paper generalizes Markov Random Field (MRF) stereo methods to the generation of surface relief (height) fields rather than disparity or depth maps. This generalization enable...
George Vogiatzis, Philip H. S. Torr, Steven M. Sei...
CORR
2007
Springer
88views Education» more  CORR 2007»
13 years 10 months ago
Target assignment for robotic networks: asymptotic performance under limited communication
— We are given an equal number of mobile robotic agents, and distinct target locations. Each agent has simple integrator dynamics, a limited communication range, and knowledge of...
Stephen L. Smith, Francesco Bullo