2638 search results - page 110 / 528 » Random Geometric Complexes |
159
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
174
click to vote
PODS
2012
ACM
13 years 7 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
137
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
141
click to vote
FCT
2005
Springer
15 years 10 months ago
2005
Springer
We review a recently introduced computation model for streaming and external memory data. An important feature of this model is that it distinguishes between sequentially reading (...
173
click to vote
GRAPHICSINTERFACE
1997
15 years 6 months ago
1997
This paper presents a system for rendering very large collections of randomly parameterized plants while generating manageable scene geometries for rendering. A given botanical de...