Sciweavers

7106 search results - page 21 / 1422
» Restricted Complexity, General Complexity
Sort
View
VIS
2008
IEEE
134views Visualization» more  VIS 2008»
14 years 8 months ago
A Practical Approach to Morse-Smale Complex Computation: Scalability and Generality
The Morse-Smale (MS) complex has proven to be a useful tool in extracting and visualizing features from scalar-valued data. However, efficient computation of the MS complex for lar...
Attila Gyulassy, Peer-Timo Bremer, Bernd Hamann,...
ALT
2002
Springer
14 years 4 months ago
The Complexity of Learning Concept Classes with Polynomial General Dimension
The general dimension is a combinatorial measure that characterizes the number of queries needed to learn a concept class. We use this notion to show that any p-evaluatable concep...
Johannes Köbler, Wolfgang Lindner
ER
2003
Springer
99views Database» more  ER 2003»
14 years 23 days ago
A General Model for Online Analytical Processing of Complex Data
Abstract. It has been well recognized that online analytical processing (OLAP) can provide important insights into huge archives of data. While the conventional OLAP model is capab...
Jian Pei
EURODAC
1994
IEEE
127views VHDL» more  EURODAC 1994»
13 years 11 months ago
A Generalized Signal Transition Graph Model for Specification of Complex Interfaces
This paper introduces a new Generalized Signal Transition Graph model for specifying complex mixed asynchronous/synchronouscircuits, as found in system-level interfaces. Our goal h...
Peter Vanbekbergen, Chantal Ykman-Couvreur, Bill L...
WADS
2005
Springer
122views Algorithms» more  WADS 2005»
14 years 1 months ago
Parameterized Complexity of Generalized Vertex Cover Problems
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...
Jiong Guo, Rolf Niedermeier, Sebastian Wernicke