Sciweavers

1802 search results - page 26 / 361
» Complexity Theory for Operators in Analysis
Sort
View
KCAP
2003
ACM
15 years 10 months ago
FONTE: factorizing ONTology engineering complexity
Because it is difficult to engineer a complex ontology with time, we here consider a method that allows for factorizing the complexity of the engineering process, FONTE (Factoriz...
Jorge Santos, Steffen Staab
124
Voted
CG
2004
Springer
15 years 4 months ago
A stratification approach for modeling two-dimensional cell complexes
This work presents a stratification approach for modeling two-dimensional cell complexes. It introduces the concept of combinatorial stratification and uses the Handlebody theory ...
Sinésio Pesco, Geovan Tavares, Hélio...
SIGECOM
2005
ACM
105views ECommerce» more  SIGECOM 2005»
15 years 10 months ago
Communication complexity of common voting rules
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
Vincent Conitzer, Tuomas Sandholm
TVCG
2012
179views Hardware» more  TVCG 2012»
13 years 7 months ago
Parallel Computation of 2D Morse-Smale Complexes
—The Morse-Smale complex is a useful topological data structure for the analysis and visualization of scalar data. This paper describes an algorithm that processes all mesh eleme...
Nithin Shivashankar, Senthilnathan M, Vijay Natara...
146
Voted
COMPGEOM
2010
ACM
15 years 9 months ago
The complexity of the normal surface solution space
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
Benjamin A. Burton