10051 search results - page 307 / 2011 » A Dynamic Separator Algorithm |
212
click to vote
SGAI
2009
Springer
16 years 1 months ago
2009
Springer
In a world where data is captured on a large scale the major challenge for data mining algorithms is to be able to scale up to large datasets. There are two main approaches to indu...
213
click to vote
WINE
2007
Springer
16 years 28 days ago
2007
Springer
A context in sponsored search is additional information about a query, such as the user’s age, gender or location, that can change an advertisement’s relevance or an advertise...
290
click to vote
SIAMIS
2011
15 years 1 months ago
2011
The convergence rate is analyzed for the sparse reconstruction by separable approximation (SpaRSA) algorithm for minimizing a sum f(x) + ψ(x), where f is smooth and ψ is convex, ...
158
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
For hypercube networks which have faulty nodes, a few ecient dynamic routing algorithms have been proposed by allowing each node to hold the status of neighbors. We propose two im...
307
click to vote
CISIS
2010
IEEE
14 years 10 months ago
2010
IEEE
Work-stealing is the todays algorithm of choice for dynamic load-balancing of irregular parallel applications on multiprocessor systems. We have evaluated the algorithm’s effic...