88 search results - page 10 / 18 » An annealing framework with learning memory |
CIKM
2008
Springer
14 years 12 months ago
2008
Springer
Tagged data is rapidly becoming more available on the World Wide Web. Web sites which populate tagging services offer a good way for Internet users to share their knowledge. An in...
IDEAS
2005
IEEE
15 years 3 months ago
2005
IEEE
Adaptive operator scheduling algorithms for continuous query processing are usually designed to serve a single performance objective, such as minimizing memory usage or maximizing...
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
Point processes are difficult to analyze because they provide only a sparse and noisy observation of the intensity function driving the process. Gaussian Processes offer an attrac...
EMNLP
2007
14 years 11 months ago
2007
Deterministic parsing has emerged as an effective alternative for complex parsing algorithms which search the entire search space to get the best probable parse tree. In this pape...
ICCV
2007
IEEE
15 years 12 months ago
2007
IEEE
Most existing subspace analysis-based tracking algorithms utilize a flattened vector to represent a target, resulting in a high dimensional data learning problem. Recently, subspa...