Sciweavers

2340 search results - page 350 / 468
» Copying and Comparing: Problems and Solutions
Sort
View
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
15 years 4 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud
ACL
2009
15 years 4 months ago
Answering Opinion Questions with Random Walks on Graphs
Opinion Question Answering (Opinion QA), which aims to find the authors' sentimental opinions on a specific target, is more challenging than traditional factbased question an...
Fangtao Li, Yang Tang, Minlie Huang, Xiaoyan Zhu
ICRA
2009
IEEE
210views Robotics» more  ICRA 2009»
15 years 4 months ago
An adaptive-scale robust estimator for motion estimation
Although RANSAC is the most widely used robust estimator in computer vision, it has certain limitations making it ineffective in some situations, such as the motion estimation prob...
Trung Ngo Thanh, Hajime Nagahara, Ryusuke Sagawa, ...
ANOR
2010
130views more  ANOR 2010»
15 years 3 months ago
Greedy scheduling with custom-made objectives
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...
Carsten Franke, Joachim Lepping, Uwe Schwiegelshoh...
CORR
2010
Springer
198views Education» more  CORR 2010»
15 years 3 months ago
Convex Graph Invariants
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
Venkat Chandrasekaran, Pablo A. Parrilo, Alan S. W...