1408 search results - page 251 / 282 » Dynamical Tensor Approximation |
STOC
2004
ACM
15 years 10 months ago
2004
ACM
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
ICFP
2008
ACM
15 years 9 months ago
2008
ACM
Self-adjusting programs respond automatically and efficiently to input changes by tracking the dynamic data dependences of the computation and incrementally updating the output as...
SAC
2010
ACM
15 years 4 months ago
2010
ACM
Service composition concerns both integration of heterogeneous distributed applications and dynamic selection of services. QoS-aware selection enables a service requester with cer...
IMC
2009
ACM
15 years 4 months ago
2009
ACM
Proximity measures quantify the closeness or similarity between nodes in a social network and form the basis of a range of applications in social sciences, business, information t...
105
click to vote
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— Scalable and efficient routing is a main challenge in the deployment of large ad hoc wireless networks. An essential element of practical routing protocols is their accommodat...