Sciweavers

6562 search results - page 1059 / 1313
» Noetherianity and Combination Problems
Sort
View
SMA
1995
ACM
176views Solid Modeling» more  SMA 1995»
15 years 10 months ago
Incremental algorithms for collision detection between solid models
: Fast and accurate collision detection between general solid models is a fundamental problem in solid modeling, robotics, animation and computer-simulated environments. Most of th...
Madhav K. Ponamgi, Dinesh Manocha, Ming C. Lin
UIST
1995
ACM
15 years 10 months ago
SDM: Selective Dynamic Manipulation of Visualizations
In this paper we present a new set of interactive techniques for 2D and 3D visualizations. This set of techniques is called SDM (Selective Dynamic Manipulation). Selective, indica...
Mei C. Chuah, Steven F. Roth, Joe Mattis, John Kol...
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
15 years 10 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
HT
1991
ACM
15 years 10 months ago
Implementing Hypertext Database Relationships through Aggregations and Exceptions
In order to combine hypertext with database facilities, we show how to extract an effective storage structure from given instance relationships. The schema of the structure recogn...
Yoshinori Hara, Arthur M. Keller, Gio Wiederhold
ICML
1994
IEEE
15 years 10 months ago
Learning Without State-Estimation in Partially Observable Markovian Decision Processes
Reinforcement learning (RL) algorithms provide a sound theoretical basis for building learning control architectures for embedded agents. Unfortunately all of the theory and much ...
Satinder P. Singh, Tommi Jaakkola, Michael I. Jord...
« Prev « First page 1059 / 1313 Last » Next »