Sciweavers

12825 search results - page 2247 / 2565
» Improved PLSOM algorithm
Sort
View
WDAG
2000
Springer
112views Algorithms» more  WDAG 2000»
15 years 8 months ago
More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs
A graph G with n vertices and maximum degree G cannot be given weak sense of direction using less than G colours. It is known that n colours are always sufficient, and it was conje...
Paolo Boldi, Sebastiano Vigna
WFLP
2000
Springer
124views Algorithms» more  WFLP 2000»
15 years 8 months ago
A Formal Approach to Reasoning about the Effectiveness of Partial Evaluation
We introduce a framework for assessing the effectiveness of partial evaluators in functional logic languages. Our framework is based on properties of the rewrite system that models...
Elvira Albert, Sergio Antoy, Germán Vidal
SPAA
1995
ACM
15 years 8 months ago
Provably Efficient Scheduling for Languages with Fine-Grained Parallelism
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...
Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias
145
Voted
SC
1991
ACM
15 years 8 months ago
A method of vector processing for shared symbolic data
Kanada, Y., A method of vector processing for shared symbolic data, Parallel Computing, X (1993) XXX-XXX. Conventional processing techniques for pipelined vector processors such a...
Yasusi Kanada
ALGOSENSORS
2009
Springer
15 years 8 months ago
Routing on Delay Tolerant Sensor Networks
Abstract. Delay (or disruption) tolerant sensor networks may be modeled as Markovian evolving graphs [1]. We present experimental evidence showing that considering multiple (possib...
Michael Keane, Evangelos Kranakis, Danny Krizanc, ...
« Prev « First page 2247 / 2565 Last » Next »