Sciweavers

3204 search results - page 114 / 641
» The Alcuin Number of a Graph
Sort
View
AAAI
2010
13 years 9 months ago
Dealing with Infinite Loops, Underestimation, and Overestimation of Depth-First Proof-Number Search
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
Akihiro Kishimoto
SIAMDM
2010
128views more  SIAMDM 2010»
13 years 6 months ago
Permutation Capacities of Families of Oriented Infinite Paths
K¨orner and Malvenuto asked whether one can find n n/2 linear orderings (i.e., permutations) of the first n natural numbers such that any pair of them places two consecutive int...
Graham Brightwell, Gérard D. Cohen, Emanuel...
ECCV
2010
Springer
14 years 2 days ago
Detection and Tracking of Large Number of Targets in Wide Area Surveillance
In this paper, we tackle the problem of object detection and tracking in a new and challenging domain of wide area surveillance. This problem poses several challenges: large camera...
CORR
2007
Springer
121views Education» more  CORR 2007»
13 years 8 months ago
On the Minimum Number of Transmissions in Single-Hop Wireless Coding Networks
— The advent of network coding presents promising opportunities in many areas of communication and networking. It has been recently shown that network coding technique can signi...
Salim Y. El Rouayheb, Mohammad Asad R. Chaudhry, A...
IV
2005
IEEE
76views Visualization» more  IV 2005»
14 years 1 months ago
Multidimensional Visualization of Transition Systems
Transition systems are graphs and it is natural to consider their visual representation as a graph visualization problem. They also pose an interesting multidimensional visualizat...
A. Johannes Pretorius, Jarke J. van Wijk