Sciweavers

267 search results - page 28 / 54
» Signatures of Combinatorial Maps
Sort
View
TCS
2008
13 years 7 months ago
Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof
This article presents formalized intuitionistic proofs for the polyhedra genus theorem, the Euler formula and a sufficient condition of planarity. They are based on a hypermap mod...
Jean-François Dufourd
JCO
2007
123views more  JCO 2007»
13 years 7 months ago
On the number of local minima for the multidimensional assignment problem
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Ol...
CPM
2011
Springer
283views Combinatorics» more  CPM 2011»
12 years 11 months ago
Frequent Submap Discovery
Combinatorial maps are nice data structures for modeling the topology of nD objects subdivided in cells (e.g., vertices, edges, faces, volumes, ...) by means of incidence and adjac...
Stéphane Gosselin, Guillaume Damiand, Chris...
ICSE
2009
IEEE-ACM
14 years 2 months ago
Semantics-based code search
Our goal is to use the vast repositories of available open source code to generate specific functions or classes that meet a user’s specifications. The key words here are spec...
Steven P. Reiss
IPPS
2005
IEEE
14 years 1 months ago
Some Issues in Solving the Anomaly Detection Problem using Immunological Approach
Results of an experimental study of an anomaly detection system based on the paradigm of artificial immune systems (AISs) are presented. Network traffic data are mapped into ant...
Franciszek Seredynski, Pascal Bouvry