15073 search results - page 2918 / 3015 » Probabilistic algorithms for computing resultants |
PEWASUN
2004
ACM
15 years 3 months ago
2004
ACM
A mobile ad hoc network consists of mobile nodes that can move freely in an open environment. Communicating nodes in a wireless and mobile ad hoc network usually seek the help of ...
SENSYS
2004
ACM
15 years 3 months ago
2004
ACM
Previous approaches for computing duplicate-sensitive aggregates in sensor networks (e.g., in TAG) have used a tree topology, in order to conserve energy and to avoid double-count...
SIGCOMM
2004
ACM
15 years 3 months ago
2004
ACM
While application end-point architectures have proven to be viable solutions for large-scale distributed applications such as distributed computing and file-sharing, there is lit...
SPAA
2004
ACM
15 years 3 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
157
click to vote
ADS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. If we wish to implement dialogue systems which express emotion, dialogue corpora annotated for emotion would be a valuable resource. In order to develop such corpora we r...