7015 search results - page 1161 / 1403 » Approximation algorithms for co-clustering |
148
click to vote
MIR
2010
ACM
15 years 10 months ago
2010
ACM
Typical tag recommendation systems for photos shared on social networks such as Flickr, use visual content analysis, collaborative filtering or personalization strategies to prod...
164
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
146
click to vote
ICRA
2008
IEEE
15 years 10 months ago
2008
IEEE
— Local linearizations are ubiquitous in the control of robotic systems. Analytical methods, if available, can be used to obtain the linearization, but in complex robotics system...
136
click to vote
QEST
2008
IEEE
15 years 10 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
203
click to vote
SSD
2007
Springer
15 years 10 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...