6575 search results - page 228 / 1315 » Specializing visualization algorithms |
196
click to vote
ADMA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Crawling the deep web often requires the selection of an appropriate set of queries so that they can cover most of the documents in the data source with low cost. This ca...
209
click to vote
AAIM
2007
Springer
16 years 21 days ago
2007
Springer
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
164
click to vote
FOCS
2006
IEEE
16 years 17 days ago
2006
IEEE
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
154
click to vote
CHES
2005
Springer
16 years 1 days ago
2005
Springer
We describe a new variant of the well known Baby-Step Giant-Step algorithm in the case of some discrete logarithms with a special structure. More precisely, we focus on discrete lo...
201
click to vote
COMPGEOM
1996
ACM
15 years 10 months ago
1996
ACM
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in...