Sciweavers

17049 search results - page 349 / 3410
» cans 2007
Sort
View
CONEXT
2007
ACM
15 years 10 months ago
Folksonomy-based reasoning in opportunistic networks
Disparate algorithms are being designed to decide certain basic questions in opportunistic networks. This position paper describes a nascent idea that aims to provide a single fra...
Nishanth R. Sastry
182
Voted
ICALP
2007
Springer
15 years 10 months ago
A Generalization of Cobham's Theorem to Automata over Real Numbers
Abstract. This paper studies the expressive power of finite-state automata recognizing sets of real numbers encoded positionally. It is known that the sets that are definable in th...
Bernard Boigelot, Julien Brusten
COMCOM
2007
99views more  COMCOM 2007»
15 years 6 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
ISCAS
2007
IEEE
112views Hardware» more  ISCAS 2007»
16 years 1 months ago
Motion Detection Circuits for a Time-To-Travel Algorithm
—We describe a new motion detection circuit that extracts motion information based on a time-to-travel algorithm. The front-end photoreceptor adapts over 7 decades of background ...
Rico Moeckel, Shih-Chii Liu
ICCS
2007
Springer
16 years 28 days ago
Scalability Analysis of the SPEC OpenMP Benchmarks on Large-Scale Shared Memory Multiprocessors
Abstract. We present a detailed investigation of the scalability characteristics of the SPEC OpenMP benchmarks on large-scale shared memory multiprocessor machines. Our study is ba...
Karl Fürlinger, Michael Gerndt, Jack Dongarra