Sciweavers

7 search results - page 1 / 2
» isaac 1992
Sort
View
ISAAC
1992
Springer
82views Algorithms» more  ISAAC 1992»
13 years 8 months ago
Lowness and the Complexity of Sparse and Tally Descriptions
Vikraman Arvind, Johannes Köbler, Martin Mund...
FGCS
2007
55views more  FGCS 2007»
13 years 4 months ago
A catallactic market for data mining services
Liviu Joita, Omer F. Rana, Felix Freitag, Isaac Ch...
ISAAC
1992
Springer
186views Algorithms» more  ISAAC 1992»
13 years 8 months ago
Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs
Let G be an undirected plane graph with non-negative edge length, and let k terminal pairs lie on two specified face boundaries. This paper presents an algorithm for finding k &quo...
Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki
FGCS
2006
115views more  FGCS 2006»
13 years 4 months ago
A universal performance factor for multi-criteria evaluation of multistage interconnection networks
The choice of an interconnection network for a parallel computer depends on a large number of performance factors which are very often application dependent. We propose a performa...
Ahmad Chadi Aljundi, Jean-Luc Dekeyser, M. Tahar K...
ISAAC
1992
Springer
125views Algorithms» more  ISAAC 1992»
13 years 8 months ago
A Simple Test for the Consecutive Ones Property
A (0,1)-matrix satisfies the consecutive ones property if there exists a column permutation such that the ones in each row of the resulting matrix are consecutive. Booth and Lueke...
Wen-Lian Hsu