407 search results - page 29 / 82 » The Optimal Online Algorithms for Minimizing Maximum Latenes... |
CIKM
2009
Springer
15 years 6 months ago
2009
Springer
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
NECO
2008
14 years 11 months ago
2008
Iterative learning algorithms that approximate the solution of support vector machines (SVMs) have two potential advantages. First, they allow for online and active learning. Seco...
102
click to vote
ALGORITHMICA
2010
14 years 12 months ago
2010
Given a cellular (mobile telephone) network, whose geographical coverage area is divided into hexagonal cells, phone calls are serviced by assigning frequencies to them so that no...
112
click to vote
ICDM
2006
IEEE
15 years 5 months ago
2006
IEEE
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
COCOON
2009
Springer
15 years 6 months ago
2009
Springer
Given a complete binary tree of height h, the online tree node assignment problem is to serve a sequence of assignment/release requests, where an assignment request, with an integ...