1909 search results - page 208 / 382 » Generalized Filtering Decomposition |
129
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
203
click to vote
INFOCOM
2006
IEEE
15 years 8 months ago
2006
IEEE
Abstract— This paper considers jointly optimal design of crosslayer congestion control, routing and scheduling for ad hoc wireless networks. We first formulate the rate constrai...
128
Voted
PODC
2005
ACM
15 years 8 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
118
Voted
INFOCOM
1998
IEEE
15 years 6 months ago
1998
IEEE
We consider the problem of routing connections with quality of service (QoS) requirements across networks when the information available for making routing decisions is inaccurate....
152
Voted
CVPR
1996
IEEE
16 years 4 months ago
1996
IEEE
This paper addresses the general 3-D rigid motion problem, where the point correspondences and the motion parameters between two sets of 3-D points are to be recovered. The existe...