5169 search results - page 117 / 1034 » Locality approximation using time |
173
click to vote
DDECS
2006
IEEE
15 years 8 months ago
2006
IEEE
Abstract-- Hard real-time systems need methods to determine upper bounds for their execution times, usually called worst-case execution times. Timing anomalies are counterintuitive...
118
click to vote
FLAIRS
2003
15 years 6 months ago
2003
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...
141
click to vote
FGR
2008
IEEE
15 years 11 months ago
2008
IEEE
Many facial image analysis methods rely on learningbased techniques such as Adaboost or SVMs to project classifiers based on the selection of local image filters (e.g., Haar and...
148
click to vote
COOPIS
2004
IEEE
15 years 8 months ago
2004
IEEE
Querying and integrating sources of structured data from the Web in most cases requires similarity-based concepts to deal with data level conflicts. This is due to the often errone...
148
click to vote
IPSN
2004
Springer
15 years 10 months ago
2004
Springer
We describe a novel method for node localization in a sensor network where there are a fraction of reference nodes with known locations. For application-specific sensor networks, ...