1813 search results - page 200 / 363 » Instance Pruning Techniques |
164
click to vote
WWW
2010
ACM
15 years 6 months ago
2010
ACM
Relational autocorrelation is ubiquitous in relational domains. This observed correlation between class labels of linked instances in a network (e.g., two friends are more likely ...
188
click to vote
CGF
2006
15 years 6 months ago
2006
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
163
click to vote
ICDM
2009
IEEE
15 years 4 months ago
2009
IEEE
Recently a number of modeling techniques have been developed for data mining and machine learning in relational and network domains where the instances are not independent and ide...
182
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
180
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
We present an approach to the recognition of complexshaped objects in cluttered environments based on edge cues. We first use example images of the desired object in typical backg...