3204 search results - page 319 / 641 » The Alcuin Number of a Graph |
210
click to vote
ECCV
2004
Springer
16 years 8 months ago
2004
Springer
Abstract. We present a probabilistic algorithm for finding correspondences across multiple images. The algorithm runs in a distributed setting, where each camera is attached to a s...
181
click to vote
IPCCC
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
156
click to vote
AICT
2006
IEEE
16 years 24 days ago
2006
IEEE
— We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the ma...
187
click to vote
QSHINE
2005
IEEE
16 years 9 days ago
2005
IEEE
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
193
click to vote
DIALM
2003
ACM
15 years 12 months ago
2003
ACM
This paper addresses the problem of scatternet formation for singlehop Bluetooth based ad hoc networks, with minimal communication overhead. We adopt the well-known structure de B...