Sciweavers

10493 search results - page 1935 / 2099
» Dynamic Word Problems
Sort
View
SIGGRAPH
1997
ACM
14 years 9 days ago
Interactive Boolean operations for conceptual design of 3-D solids
Interactive modeling of 3-D solids is an important and difficult problem in computer graphics. The Constructive Solid Geometry (CSG) modeling scheme is highly attractive for inte...
Ari Rappoport, Steven N. Spitz
CPM
1993
Springer
125views Combinatorics» more  CPM 1993»
14 years 7 days ago
Detecting False Matches in String Matching Algorithms
Consider a text string of length n, a pattern string of length m, and a match vector of length n which declares each location in the text to be either a mismatch (the pattern does ...
S. Muthukrishnan
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
14 years 6 days ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani
STOC
1993
ACM
117views Algorithms» more  STOC 1993»
14 years 6 days ago
Efficient noise-tolerant learning from statistical queries
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
Michael J. Kearns
SIGIR
1992
ACM
14 years 6 days ago
Bead: Explorations in Information Visualization
ct We describe work on the visualization of bibliographic data and, to aid in this task, the application of numerical techniques for multidimensional scaling. Many areas of scienti...
Matthew Chalmers, Paul Chitson
« Prev « First page 1935 / 2099 Last » Next »