Sciweavers

3864 search results - page 339 / 773
» time 2005
Sort
View
COCOON
2005
Springer
16 years 9 days ago
Improved Algorithms for the K-Maximum Subarray Problem for Small K
The maximum subarray problem for a one- or two-dimensional array is to find the array portion that maiximizes the sum of array elements in it. The K-maximum subarray problem is to...
Sung Eun Bae, Tadao Takaoka
COCOON
2005
Springer
16 years 9 days ago
Bounded Degree Closest k-Tree Power Is NP-Complete
Abstract. An undirected graph G = (V, E) is the k-power of an undirected tree T = (V, E ) if (u, v) ∈ E iff u and v are connected by a path of length at most k in T. The tree T ...
Michael Dom, Jiong Guo, Rolf Niedermeier
COCOON
2005
Springer
16 years 9 days ago
Interference in Cellular Networks: The Minimum Membership Set Cover Problem
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
Fabian Kuhn, Pascal von Rickenbach, Roger Wattenho...
COCOON
2005
Springer
16 years 9 days ago
Fault-Tolerant Relay Node Placement in Wireless Sensor Networks
The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in an Euclidean plane, our objective is to place minimum nu...
Hai Liu, Peng-Jun Wan, Xiaohua Jia
CONTEXT
2005
Springer
16 years 8 days ago
Utilizing Visual Attention for Cross-Modal Coreference Interpretation
In this paper, we describe an exploratory study to develop a model of visual attention that could aid automatic interpretation of exophors in situated dialog. The model is intended...
Donna K. Byron, Thomas Mampilly, Vinay Sharma, Tia...