450 search results - page 28 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
117
click to vote
JACM
2008
14 years 11 months ago
2008
XML queries are usually expressed by means of XPath expressions identifying portions of the selected documents. An XPath expression defines a way of navigating an XML tree and ret...
MDM
2007
Springer
15 years 6 months ago
2007
Springer
— We consider the problem of efficiently broadcasting incremental updates to multiple terminals that contain outdated (and possibly different) initial copies of the data. This s...
113
click to vote
ECAI
2006
Springer
15 years 3 months ago
2006
Springer
The coalition formation process, in which a number of independent, autonomous agents come together to act as a collective, is an important form of interaction in multi-agent system...
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—Network coding is a method that promises to achieve the min-cut capacity in multicasts. However, pushing towards this gain in throughput comes with two sacrifices. Delay suffer...
150
click to vote
SENSYS
2006
ACM
15 years 5 months ago
2006
ACM
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...