Sciweavers

5210 search results - page 867 / 1042
» Exact geometric computation
Sort
View
147
Voted
VISUALIZATION
1995
IEEE
15 years 6 months ago
Tensor Product Surfaces Guided by Minimal Surface Area Triangulations
We present a method for constructing tensor product Bezier surfaces from contour (cross-section) data. Minimal area triangulations are used to guide the surface construction, and ...
John K. Johnstone, Kenneth R. Sloan
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
15 years 6 months ago
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Rafi Heiman, Avi Wigderson
AIPS
2008
15 years 5 months ago
Bounded-Parameter Partially Observable Markov Decision Processes
The POMDP is considered as a powerful model for planning under uncertainty. However, it is usually impractical to employ a POMDP with exact parameters to model precisely the real-...
Yaodong Ni, Zhi-Qiang Liu
COMPGEOM
2005
ACM
15 years 5 months ago
Learning smooth objects by probing
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...
Jean-Daniel Boissonnat, Leonidas J. Guibas, Steve ...
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
15 years 5 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau