7015 search results - page 311 / 1403 » Approximation algorithms for co-clustering |
164
click to vote
EDBT
2009
ACM
16 years 1 months ago
2009
ACM
We study the problem of estimating selectivity of approximate substring queries. Its importance in databases is ever increasing as more and more data are input by users and are in...
166
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
We consider a process called Group Network Formation Game, which represents the scenario when strategic agents are building a network together. In our game, agents can have extrem...
181
click to vote
SMI
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract In this paper, we study the problem of approximate topological matching for quadrilateral meshes, that is, the problem of finding as large a set as possible of matching p...
165
click to vote
MFCS
2007
Springer
16 years 25 days ago
2007
Springer
Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...
179
click to vote
ATAL
2005
Springer
16 years 7 days ago
2005
Springer
State estimation consists of updating an agent’s belief given executed actions and observed evidence to date. In single agent environments, the state estimation can be formalize...