16666 search results - page 2765 / 3334 » Descriptive and Computational Complexity |
189
click to vote
EWSN
2007
Springer
16 years 6 months ago
2007
Springer
Methods for node localisation in sensor networks usually rely upon the measurement of received strength, time-of-arrival, and/or angle-of-arrival of an incoming signal. In this pap...
173
click to vote
MOBIHOC
2004
ACM
16 years 6 months ago
2004
ACM
APS algorithms use the basic idea of distance vector routing to find positions in an ad hoc network using only a fraction of landmarks, for example GPS enabled nodes. All the node...
294
click to vote
ASC
2007
16 years 6 months ago
2007
Credit risk has always been an important issue for banks
and other financial intermediaries. A reliable and consistent
computing system is necessary to simplify the decision
mak...
196
click to vote
ICDE
2010
IEEE
16 years 4 months ago
2010
IEEE
— Many applications require sorting a table over multiple sort orders: generation of multiple reports from a table, evaluation of a complex query that involves multiple instances...
183
click to vote
SDM
2009
SIAM
16 years 4 months ago
2009
SIAM
The requirements of real-world data mining problems vary extensively. It is plausible to assume that some of these requirements can be expressed as application-specific performan...