Sciweavers

518 search results - page 87 / 104
» Object correspondence as a machine learning problem
Sort
View
AOR
2007
107views more  AOR 2007»
14 years 11 months ago
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
Juraj Hromkovic, Tobias Mömke, Kathleen Stein...
ECCV
2010
Springer
15 years 5 months ago
Robust Multi-View Boosting with Priors
Many learning tasks for computer vision problems can be described by multiple views or multiple features. These views can be exploited in order to learn from unlabeled data, a.k.a....
WWW
2009
ACM
16 years 11 days ago
Understanding user's query intent with wikipedia
Understanding the intent behind a user's query can help search engine to automatically route the query to some corresponding vertical search engines to obtain particularly re...
Jian Hu, Gang Wang, Frederick H. Lochovsky, Jian-T...
IPM
2008
100views more  IPM 2008»
14 years 11 months ago
Query-level loss functions for information retrieval
Many machine learning technologies such as support vector machines, boosting, and neural networks have been applied to the ranking problem in information retrieval. However, since...
Tao Qin, Xu-Dong Zhang, Ming-Feng Tsai, De-Sheng W...
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
16 years 3 days ago
Domain-constrained semi-supervised mining of tracking models in sensor networks
Accurate localization of mobile objects is a major research problem in sensor networks and an important data mining application. Specifically, the localization problem is to deter...
Rong Pan, Junhui Zhao, Vincent Wenchen Zheng, Jeff...