1469 search results - page 288 / 294 » Approximate polynomial decomposition |
DCOSS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
117
click to vote
ESA
1995
Springer
15 years 1 months ago
1995
Springer
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
BMVC
2001
15 years 13 hour ago
2001
The ability to construct CAD or other object models from edge and range data has a fundamental meaning in building a recognition and positioning system. While the problem of model...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
85
Voted
PICS
2003
14 years 11 months ago
2003
To establish a correlation between the system output and the corresponding reflectance, the system characterisation functionDeriving the actual multispectral data from the output o...