Sciweavers

494 search results - page 82 / 99
» Heap Building Bounds
Sort
View
145
Voted
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
15 years 3 months ago
Dynamic Trees and Dynamic Point Location
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
Michael T. Goodrich, Roberto Tamassia
171
Voted
CORR
2011
Springer
178views Education» more  CORR 2011»
14 years 7 months ago
Online Learning: Stochastic and Constrained Adversaries
Learning theory has largely focused on two main learning scenarios. The first is the classical statistical setting where instances are drawn i.i.d. from a fixed distribution and...
Alexander Rakhlin, Karthik Sridharan, Ambuj Tewari
168
Voted
TACAS
2012
Springer
277views Algorithms» more  TACAS 2012»
13 years 11 months ago
Proving Reachability Using FShell - (Competition Contribution)
FShell is an automated white-box test-input generator for C programs, computing test data with respect to user-specified code coverage criteria. The pillars of FShell are the decl...
Andreas Holzer, Daniel Kroening, Christian Schallh...
124
Voted
SODA
2012
ACM
177views Algorithms» more  SODA 2012»
13 years 6 months ago
Stochastic coalescence in logarithmic time
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
Po-Shen Loh, Eyal Lubetzky
172
Voted
TVCG
2012
195views Hardware» more  TVCG 2012»
13 years 6 months ago
Restricted Trivariate Polycube Splines for Volumetric Data Modeling
—This paper presents a volumetric modeling framework to construct a novel spline scheme called restricted trivariate polycube splines (RTP-splines). The RTP-spline aims to genera...
Kexiang Wang, Xin Li, Bo Li 0014, Huanhuan Xu, Hon...