1629 search results - page 218 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
PARLE
1987
1987
Emulating Digital Logic using Transputer Networks (very High Parallelism = Simplicity = Performance)
15 years 1 months ago
Modern VLSI technology has changed the economic rules by which the balance between processing power, memory and communications is decided in computing systems. This will have a pr...
MOBICOM
2003
ACM
15 years 3 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
EMNLP
2010
14 years 8 months ago
2010
Although many algorithms have been developed to harvest lexical resources, few organize the mined terms into taxonomies. We propose (1) a semi-supervised algorithm that uses a roo...
165
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
We address the problem of preserving privacy in streams, which has received surprisingly limited attention. For static data, a well-studied and widely used approach is based on ra...
IWOMP
2007
Springer
15 years 4 months ago
2007
Springer
OpenMP is widely used for shared memory parallel programming and is especially useful for the parallelisation of loops. When it comes to task parallelism, however, OpenMP is less p...