Sciweavers

280 search results - page 27 / 56
» Using Determining Sets to Distinguish Kneser Graphs
Sort
View
FPGA
1998
ACM
142views FPGA» more  FPGA 1998»
15 years 4 months ago
A Hybrid Complete-Graph Partial-Crossbar Routing Architecture for Multi-FPGA Systems
Multi-FPGA systems (MFSs) are used as custom computing machines, logic emulators and rapid prototyping vehicles. A key aspect of these systems is their programmable routing archit...
Mohammed A. S. Khalid, Jonathan Rose
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
15 years 5 months ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
ENTCS
2007
93views more  ENTCS 2007»
14 years 11 months ago
Modeling Pointer Redirection as Cyclic Term-graph Rewriting
We tackle the problem of data-structure rewriting including global and local pointer redirections. Each basic rewrite step may perform three kinds of actions: (i) Local redirectio...
Dominique Duval, Rachid Echahed, Fréd&eacut...
RECOMB
2004
Springer
16 years 1 days ago
Mining protein family specific residue packing patterns from protein structure graphs
Finding recurring residue packing patterns, or spatial motifs, that characterize protein structural families is an important problem in bioinformatics. To this end, we apply a nov...
Jun Huan, Wei Wang 0010, Deepak Bandyopadhyay, Jac...
ICIAP
2003
ACM
15 years 12 months ago
A shortest path representation for video summarisation
A novel approach is presented to select multiple key frames within an isolated video shot where there is camera motion causing significant scene change. This is achieved by determ...
Sarah V. Porter, Majid Mirmehdi, Barry T. Thomas