Sciweavers

29908 search results - page 288 / 5982
» On the Complexity of
Sort
View
GECCO
2003
Springer
127views Optimization» more  GECCO 2003»
16 years 20 days ago
Complex Function Sets Improve Symbolic Discriminant Analysis of Microarray Data
Abstract. Our ability to simultaneously measure the expression levels of thousands of genes in biological samples is providing important new opportunities for improving the diagnos...
David M. Reif, Bill C. White, Nancy Olsen, Thomas ...
197
Voted
ESWS
2010
Springer
16 years 8 days ago
Facet Graphs: Complex Semantic Querying Made Easy
While the Semantic Web is rapidly filling up, appropriate tools for searching it are still at infancy. In this paper we describe an approach that allows humans to access informatio...
Philipp Heim, Thomas Ertl, Jürgen Ziegler
178
Voted
CSL
2001
Springer
15 years 12 months ago
Capture Complexity by Partition
We show in this paper a special extended logic, partition logic based on so called partition quantifiers, is able to capture some important complexity classes NP, P and NL by its ...
Yijia Chen, Enshao Shen
195
Voted
ICALP
2001
Springer
15 years 12 months ago
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
Peter Høyer, Jan Neerbek, Yaoyun Shi
214
Voted
RT
2001
Springer
15 years 12 months ago
Interactive Sampling and Rendering for Complex and Procedural Geometry
We present a new sampling method for procedural and complex geometries, which allows interactive point-based modeling and rendering of such scenes. For a variety of scenes, object-...
Marc Stamminger, George Drettakis