Sciweavers

970 search results - page 176 / 194
» On encodings of spanning trees
Sort
View
LICS
1997
IEEE
14 years 2 months ago
Ground Reducibility is EXPTIME-Complete
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
Hubert Comon, Florent Jacquemard
VVS
1996
IEEE
129views Visualization» more  VVS 1996»
14 years 2 months ago
Optimal Isosurface Extraction from Irregular Volume Data
A method is proposed which supports the extraction of isosurfaces from irregular volume data, represented by tetrahedral decomposition, in optimal time. The method is based on a d...
Paolo Cignoni, Claudio Montani, Enrico Puppo, Robe...
DIS
2007
Springer
14 years 1 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono
JAVA
2000
Springer
14 years 1 months ago
A portable sampling-based profiler for Java virtual machines
This paper describes a portable and efficient sampling-based online measurement system for production-level Java virtual machines. This system is designed to provide continuous re...
John Whaley
ANLP
1997
73views more  ANLP 1997»
13 years 11 months ago
Software for Annotating Argument Structure
We present a tool developed for annotating corpora with argument structure representations. The presentation focuses on the architecture of the annotation scheme and a number of t...
Wojciech Skut, Brigitte Krenn, Thorsten Brants, Ha...