Sciweavers

2069 search results - page 274 / 414
» Linear time algorithms for Clobber
Sort
View
COCOON
1997
Springer
15 years 10 months ago
Edge and Node Searching Problems on Trees
In this paper, we consider the edge searching and node searching problems on trees. Given a tree, we show a transformation from an optimal node-search strategy to an optimal edge-...
Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming...
CPM
2007
Springer
134views Combinatorics» more  CPM 2007»
15 years 10 months ago
Efficient Computation of Substring Equivalence Classes with Suffix Arrays
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai,...
ICISP
2010
Springer
15 years 10 months ago
Total Variation Minimization with Separable Sensing Operator
Compressed Imaging is the theory that studies the problem of image recovery from an under-determined system of linear measurements. One of the most popular methods in this field i...
Serge L. Shishkin, Hongcheng Wang, Gregory S. Hage...
AIPS
2006
15 years 7 months ago
Goal Achievement in Partially Known, Partially Observable Domains
We present a decision making algorithm for agents that act in partially observable domains which they do not know fully. Making intelligent choices in such domains is very difficu...
Allen Chang, Eyal Amir
CCE
2005
15 years 6 months ago
Use of parallel computers in rational design of redundant sensor networks
A general method to design optimal redundant sensor network even in the case of one sensor failure and able to estimate process key parameters within a required accuracy is propos...
Carine Gerkens, Georges Heyen