Sciweavers

10916 search results - page 2087 / 2184
» On Constructive Connectives and Systems
Sort
View
COCOON
1998
Springer
15 years 10 months ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
SIGGRAPH
1997
ACM
15 years 10 months 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
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
15 years 10 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill
STOC
1997
ACM
257views Algorithms» more  STOC 1997»
15 years 10 months ago
Practical Loss-Resilient Codes
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
EURODAC
1994
IEEE
209views VHDL» more  EURODAC 1994»
15 years 10 months ago
MOS VLSI circuit simulation by hardware accelerator using semi-natural models
- The accelerator is destined to circuit-level simulation of digital and analog/digital MOS VLSI'c containing of up to 100 thousand transistors (with 16 Mb RAM host-machine). ...
Victor V. Denisenko
« Prev « First page 2087 / 2184 Last » Next »