Sciweavers

10608 search results - page 574 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
VISUALIZATION
2003
IEEE
16 years 11 days ago
Extraction of topologically simple isosurfaces from volume datasets
There are numerous algorithms in graphics and visualization whose performance is known to decay as the topological complexity of the input increases. On the other hand, the standa...
Andrzej Szymczak, James Vanderhyde
COCO
2001
Springer
107views Algorithms» more  COCO 2001»
15 years 11 months ago
In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time
Restricting the search space {0, 1}n to the set of truth tables of “easy” Boolean functions on log n variables, as well as using some known hardness-randomness tradeoffs, we ...
Russell Impagliazzo, Valentine Kabanets, Avi Wigde...
AIME
2009
Springer
15 years 11 months ago
The Role of Biomedical Dataset in Classification
In this paper, we investigate the role of a biomedical dataset on the classification accuracy of an algorithm. We quantify the complexity of a biomedical dataset using five complex...
Ajay Kumar Tanwani, Muddassar Farooq
EH
2004
IEEE
102views Hardware» more  EH 2004»
15 years 11 months ago
Design Space Issues for Intrinsic Evolvable Hardware
This paper discusses the problem of increased programming time for intrinsic evolvable hardware (EHW) as the complexity of the circuit grows. We develop equations for the size of ...
James Hereford, David A. Gwaltney
INFOCOM
1997
IEEE
15 years 10 months ago
Efficient Admission Control for EDF Schedulers
In this paper we present algorithms for flow admission control at an EDF link scheduler when the flows are characterized by peak rate, average rate and burst size. We show that th...
Victor Firoiu, James F. Kurose, Donald F. Towsley