Sciweavers

310 search results - page 49 / 62
» Cutting two graphs simultaneously
Sort
View
SMI
2008
IEEE
110views Image Analysis» more  SMI 2008»
14 years 4 months ago
OCTOR: OCcurrence selecTOR in pattern hierarchies
Hierarchies of patterns of features, of sub-assemblies, or of CSG sub-expressions are used in architectural and mechanical CAD to eliminate laborious repetitions from the design p...
Justin Jang, Jarek Rossignac
CPC
2002
95views more  CPC 2002»
13 years 10 months ago
Permutation Pseudographs And Contiguity
The space of permutation pseudographs is a probabilistic model of 2-regular pseudographs on n vertices, where a pseudograph is produced by choosing a permutation of {1, 2, . . . ...
Catherine S. Greenhill, Svante Janson, Jeong Han K...
ATAL
2010
Springer
13 years 11 months ago
A decentralised coordination algorithm for minimising conflict and maximising coverage in sensor networks
In large wireless sensor networks, the problem of assigning radio frequencies to sensing agents such that no two connected sensors are assigned the same value (and will thus inter...
Ruben Stranders, Alex Rogers, Nicholas R. Jennings
ICAIL
2009
ACM
14 years 2 months ago
The network of French legal codes
We propose an analysis of the codified Law of France as a structured system. Fifty two legal codes are selected on the basis of explicit legal criteria and considered as vertices ...
Pierre Mazzega, Danièle Bourcier, Romain Bo...
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
14 years 1 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre