Sciweavers

680 search results - page 87 / 136
» Computational Complexity and Anytime Algorithm for Inconsist...
Sort
View
GIS
2006
ACM
15 years 6 months ago
Qualitative polyline similarity testing with applications to query-by-sketch, indexing and classification
We present an algorithm for polyline (and polygon) similarity testing that is based on the double-cross formalism. To determine the degree of similarity between two polylines, the...
Bart Kuijpers, Bart Moelans, Nico Van de Weghe
MOBIHOC
2004
ACM
16 years 5 months ago
Error characteristics of ad hoc positioning systems (aps)
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...
Dragos Niculescu, Badri Nath
VTC
2008
IEEE
161views Communications» more  VTC 2008»
16 years 11 days ago
Using WLAN Infrastructure for Angle-of-Arrival Indoor User Location
—This paper investigates the potential for future multiple antenna wireless local area network technologies such as 802.11n to perform indoor network-based positioning using angl...
Carl Wong, Richard Klukas, Geoffrey G. Messier
MP
2006
87views more  MP 2006»
15 years 6 months ago
Convexity and decomposition of mean-risk stochastic programs
Abstract. Traditional stochastic programming is risk neutral in the sense that it is concerned with the optimization of an expectation criterion. A common approach to addressing ri...
Shabbir Ahmed
ISSTA
2000
ACM
15 years 10 months ago
Which pointer analysis should I use?
During the past two decades many di erent pointer analysis algorithms have been published. Although some descriptions include measurements of the e ectiveness of the algorithm, qu...
Michael Hind, Anthony Pioli