Sciweavers

6833 search results - page 1031 / 1367
» Some two-character sets
Sort
View
IPL
2008
89views more  IPL 2008»
15 years 6 months ago
On the tractability of coloring semirandom graphs
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
Julia Böttcher, Dan Vilenchik
IJBC
2006
50views more  IJBC 2006»
15 years 6 months ago
Phenomenology of Reaction-diffusion Binary-State Cellular Automata
We study a binary-cell-states eight-cell neighborhood two-dimensional cellular automaton model of a quasi-chemical system with a substrate and a reagent. Reactions are represented...
Andrew Adamatzky, Genaro Juárez Martí...
COMBINATORICS
2007
72views more  COMBINATORICS 2007»
15 years 6 months ago
Matrix Partitions with Finitely Many Obstructions
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
Tomás Feder, Pavol Hell, Wing Xie
IPM
2008
196views more  IPM 2008»
15 years 6 months ago
Author identification: Using text sampling to handle the class imbalance problem
Authorship analysis of electronic texts assists digital forensics and anti-terror investigation. Author identification can be seen as a single-label multi-class text categorizatio...
Efstathios Stamatatos
COMCOM
2007
124views more  COMCOM 2007»
15 years 6 months ago
Path planning of mobile landmarks for localization in wireless sensor networks
Many applications of wireless sensor networks require the sensor nodes to obtain their locations. The main idea in most localization methods has been that some nodes with known co...
Dimitrios Koutsonikolas, Saumitra M. Das, Y. Charl...
« Prev « First page 1031 / 1367 Last » Next »