12257 search results - page 58 / 2452 » Analysis of Algorithms |
CSCLP
2005
Springer
14 years 2 months ago
2005
Springer
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...
CIKM
2004
Springer
14 years 2 months ago
2004
Springer
Mining massive temporal data streams for significant trends, emerging buzz, and unusually high or low activity is an important problem with several commercial applications. In th...
APNOMS
2006
Springer
14 years 28 days ago
2006
Springer
In this paper, an adaptive soft handoff algorithm, which dynamically calculates the threshold values for soft handoff based on the received signal strength, is proposed for mobile ...
CVHI
2007
13 years 10 months ago
2007
: We are developing computer vision algorithms for sensing important terrain features as an aid to wheelchair navigation, which interpret visual information obtained from images co...
EMNLP
2008
13 years 10 months ago
2008
Bootstrapping has a tendency, called semantic drift, to select instances unrelated to the seed instances as the iteration proceeds. We demonstrate the semantic drift of bootstrapp...