874 search results - page 25 / 175 » Faster Algorithms for Semi-Matching Problems |
NIPS
2007
13 years 9 months ago
2007
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
JDCTA
2010
13 years 2 months ago
2010
A novel breadth-first based structural clustering method for graphs is proposed. Clustering is an important task for analyzing complex networks such as biological networks, World ...
TSMC
2010
13 years 2 months ago
2010
Abstract--Optimal deployment and accurate localization of sensor nodes have a strong influence on the performance of a wireless sensor network (WSN). This paper considers real-time...
SIGGRAPH
1994
ACM
13 years 11 months ago
1994
ACM
A new algorithm for computing contact forces between solid objects with friction is presented. The algorithm allows a mix of contact points with static and dynamic friction. In co...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
This work describes a forward-looking approach for the solution of dynamic (time-changing) problems using evolutionary algorithms. The main idea of the proposed method is to combi...