Sciweavers

702 search results - page 47 / 141
» Identifying Graph Automorphisms Using Determining Sets
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...
ANOR
2005
102views more  ANOR 2005»
14 years 11 months ago
Locating Active Sensors on Traffic Networks
Sensors are used to monitor traffic in networks. For example, in transportation networks, they may be used to measure traffic volumes on given arcs and paths of the network. This p...
Monica Gentili, Pitu B. Mirchandani
BMCBI
2010
137views more  BMCBI 2010»
14 years 12 months ago
TreeGraph 2: Combining and visualizing evidence from different phylogenetic analyses
Background: Today it is common to apply multiple potentially conflicting data sources to a given phylogenetic problem. At the same time, several different inference techniques are...
Ben C. Stöver, Kai F. Müller