Sciweavers

730 search results - page 118 / 146
» Combinatorics of Monotone Computations
Sort
View
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
14 years 29 days ago
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang
ICCS
2004
Springer
14 years 28 days ago
An Incremental Editor for Dynamic Hierarchical Drawing of Trees
We present an incremental tree editor based on algorithms for manipulating shape functions. The tree layout is hierarchical, left-to-right. Nodes of variable size and shape are sup...
David Workman, Margaret Bernard, Steven Pothoven
MFCS
2004
Springer
14 years 28 days ago
Optimal Preemptive Scheduling for General Target Functions
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
Leah Epstein, Tamir Tassa
SWAT
2004
Springer
78views Algorithms» more  SWAT 2004»
14 years 27 days ago
Online Maintenance of k-Medians and k-Covers on a Line
The standard dynamic programming solution to finding k-medians on a line with n nodes requires O(kn2 ) time. Dynamic programming speedup techniques, e.g., use of the quadrangle i...
Rudolf Fleischer, Mordecai J. Golin, Yan Zhang
VLDB
2004
ACM
73views Database» more  VLDB 2004»
14 years 27 days ago
Multi-objective Query Processing for Database Systems
Query processing in database systems has developed beyond mere exact matching of attribute values. Scoring database objects and retrieving only the top k matches or Pareto-optimal...
Wolf-Tilo Balke, Ulrich Güntzer