Sciweavers

10988 search results - page 197 / 2198
» Algorithmic Folding Complexity
Sort
View
123
Voted
COMSIS
2010
15 years 1 months ago
Metrics for evaluation of metaprogram complexity
The concept of complexity is used in many areas of computer science and software engineering. Software complexity metrics can be used to evaluate and compare quality of software de...
Robertas Damasevicius, Vytautas Stuikys
124
Voted
VIS
2007
IEEE
120views Visualization» more  VIS 2007»
16 years 4 months ago
Efficient Computation of Morse-Smale Complexes for Three-dimensional Scalar Functions
The Morse-Smale complex is an efficient representation of the gradient behavior of a scalar function, and critical points paired by the complex identify topological features and th...
Attila Gyulassy, Vijay Natarajan, Valerio Pascuc...
115
Voted
COCO
1995
Springer
83views Algorithms» more  COCO 1995»
15 years 7 months ago
The Instance Complexity Conjecture
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...
Martin Kummer
119
Voted
SIGMOD
2003
ACM
105views Database» more  SIGMOD 2003»
16 years 3 months ago
Factorizing Complex Predicates in Queries to Exploit Indexes
Decision-support applications generate queries with complex predicates. We show how the factorization of complex query expressions exposes significant opportunities for exploiting...
Surajit Chaudhuri, Prasanna Ganesan, Sunita Sarawa...
135
Voted
STOC
2007
ACM
84views Algorithms» more  STOC 2007»
16 years 3 months ago
Lower bounds in communication complexity based on factorization norms
We introduce a new method to derive lower bounds on randomized and quantum communication complexity. Our method is based on factorization norms, a notion from Banach Space theory....
Nati Linial, Adi Shraibman