1039 search results - page 90 / 208 » Kernels and Regularization on Graphs |
131
Voted
SODA
2012
ACM
13 years 3 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
109
Voted
AIRWEB
2007
Springer
15 years 7 months ago
2007
Springer
Web spam can significantly deteriorate the quality of search engines. Early web spamming techniques mainly manipulate page content. Since linkage information is widely used in we...
92
Voted
AI
2002
Springer
15 years 18 days ago
2002
Springer
The emergence of social conventions in multi-agent systems has been analyzed mainly in settings where every agent may interact either with every other agent or with nearest neighb...
SOSP
1997
ACM
15 years 2 months ago
1997
ACM
Implementing new operating systems is tedious, costly, and often impractical except for large projects. The Flux OSKit addresses this problem in a novel way by providing clean, we...
122
Voted
ICDM
2006
IEEE
15 years 6 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...