8298 search results - page 1390 / 1660 » On the Complexity of Numerical Analysis |
179
click to vote
FOCS
1995
IEEE
15 years 10 months ago
1995
IEEE
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
168
click to vote
ICCBR
1995
Springer
15 years 10 months ago
1995
Springer
The particular strength of CBR is normally considered to be its use in weak theory domains where solution quality is compiled into cases and is reusable. In this paper we explore a...
252
click to vote
VISUALIZATION
1995
IEEE
15 years 10 months ago
1995
IEEE
Advances in computer graphics hardware and algorithms, visualization, and interactive techniques for analysis offer the components for a highly integrated, efficient real-time 3D ...
197
click to vote
HT
1991
ACM
15 years 10 months ago
1991
ACM
Hypertext systems are being used in many applications because of their flexible structure and the great browsing freedom they give to diverse communities of users. However, this s...
175
click to vote
SIGGRAPH
1991
ACM
15 years 10 months ago
1991
ACM
Algorithms and computational complexity measures for simulating the motion of contacting bodies with friction are presented. The bodies are restricted to be perfectly rigid bodies...