3415 search results - page 541 / 683 » Lower Bounds for Kernelizations |
125
click to vote
SAC
2005
ACM
15 years 10 months ago
2005
ACM
This paper presents an efficient technique for placement and routing of sensors/actuators and processing units in a grid network. Our system requires an extremely high level of ro...
129
click to vote
AP2PC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The research in the paper is motivated by building a decentralized/P2P XML storage on top of a DHT (Distributed Hash Table). The storage must provide high data availabili...
128
click to vote
APPROX
2005
Springer
15 years 10 months ago
2005
Springer
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangeme...
125
click to vote
COCO
2005
Springer
15 years 10 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
120
click to vote
ECAL
2005
Springer
15 years 10 months ago
2005
Springer
Efficient hierarchical architectures for reconfigurable and adaptive multi-agent networks require dynamic cluster formation among the set of nodes (agents). In the absence of cen...