12519 search results - page 347 / 2504 » Approximation Problems Categories |
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...
167
click to vote
TACAS
2005
Springer
16 years 5 days ago
2005
Springer
This paper addresses the problem of generating symbolic test cases for testing the conformance of a black-box implementation with respect to a specification, in the context of rea...
238
click to vote
STOC
1998
ACM
15 years 11 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
175
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...
145
click to vote
APPML
2007
15 years 6 months ago
2007
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...