7015 search results - page 1074 / 1403 » Approximation algorithms for co-clustering |
172
click to vote
ICDE
2010
IEEE
15 years 11 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
132
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgrap...
143
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
132
click to vote
ATAL
2009
Springer
15 years 11 months ago
2009
Springer
Recent scaling up of decentralized partially observable Markov decision process (DEC-POMDP) solvers towards realistic applications is mainly due to approximate methods. Of this fa...
175
click to vote
KSEM
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...