7930 search results - page 440 / 1586 » Greedy in Approximation Algorithms |
170
Voted
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...
174
Voted
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...
170
click to vote
MFCS
2007
Springer
16 years 1 months 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...
184
Voted
ATAL
2005
Springer
16 years 12 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...
183
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....