Sciweavers

10412 search results - page 1394 / 2083
» The efficiency of algorithms - misconceptions
Sort
View
IPPS
1998
IEEE
15 years 11 months ago
Optimally Locating a Structured Facility of a Specified Length in a Weighted Tree Network
including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified...
Shan-Chyun Ku, Biing-Feng Wang
VVS
1998
IEEE
133views Visualization» more  VVS 1998»
15 years 11 months ago
An Accurate Method for Voxelizing Polygon Meshes
The process of generating discrete surfaces in a volumetric representation, termed voxelization, is confronted with topological considerations as well as accuracy and efficiency r...
Jian Huang, Roni Yagel, Vassily Filippov, Yair Kur...
ADBIS
1998
Springer
100views Database» more  ADBIS 1998»
15 years 11 months ago
Multiple Range Query Optimization in Spatial Databases
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...
Apostolos Papadopoulos, Yannis Manolopoulos
PLDI
1998
ACM
15 years 11 months ago
Simplification of Array Access Patterns for Compiler Optimizations
Existing array region representation techniques are sensitive to the complexity of array subscripts. In general, these techniques are very accurate and efficient for simple subscr...
Yunheung Paek, Jay Hoeflinger, David A. Padua
ICLP
1998
Springer
15 years 11 months ago
A Choice-Point Library for Backtrack Programming
Implementing a compiler for a language with nondeterministic features is known to be a difficult task. This paper presents two new functions setChoicePoint and fail that extend th...
Pierre-Etienne Moreau
« Prev « First page 1394 / 2083 Last » Next »