Sciweavers

595 search results - page 18 / 119
» Incidence of
Sort
View
COMBINATORICS
2006
116views more  COMBINATORICS 2006»
13 years 8 months ago
Neighbour-Distinguishing Edge Colourings of Random Regular Graphs
A proper edge colouring of a graph is neighbour-distinguishing if for all pairs of adjacent vertices v, w the set of colours appearing on the edges incident with v is not equal to...
Catherine S. Greenhill, Andrzej Rucinski
CHI
2009
ACM
14 years 9 months ago
Undo and erase events as indicators of usability problems
One approach to reducing the costs of usability testing is to facilitate the automatic detection of critical incidents: serious breakdowns in interaction that stand out during sof...
David Akers, Matthew Simpson, Robin Jeffries, Terr...
DCC
2004
IEEE
14 years 8 months ago
LDPC Codes from Triangle-Free Line Sets
We study sets of lines of AG(n, q) and PG(n, q) with the property that no three lines form a triangle. As a result the associated point-line incidence graph contains no 6-cycles a...
Keith E. Mellinger
WADS
2007
Springer
106views Algorithms» more  WADS 2007»
14 years 2 months ago
Maximizing Maximal Angles for Plane Straight-Line Graphs
Let G = (S, E) be a plane straight-line graph on a finite point set S ⊂ R2 in general position. The incident angles of a point p ∈ S in G are the angles between any two edges ...
Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, ...
ICCBR
1999
Springer
14 years 21 days ago
Is CBR Applicable to the Coordination of Search and Rescue Operations? A Feasibility Study
In response to the occurrence of an air incident, controllers at one of the three Canadian Rescue Coordination Centers (RCC) must make a series of critical decisions on the appropr...
Irène Abi-Zeid, Qiang Yang, Luc Lamontagne