Sciweavers

4860 search results - page 133 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
ACMSE
2000
ACM
14 years 2 months ago
Exploring an information-based approach to computation and computational complexity
We present the background and justi cation for a new approachto studying computation and computational complexity. We focus on categories of problems and categories of solutions w...
D. E. Stevenson
INFOCOM
2008
IEEE
14 years 4 months ago
Connectivity-Based Localization of Large Scale Sensor Networks with Complex Shape
—We study the problem of localizing a large sensor network having a complex shape, possibly with holes. A major challenge with respect to such networks is to figure out the corr...
Sol Lederer, Yue Wang, Jie Gao
DMDW
2000
93views Management» more  DMDW 2000»
13 years 11 months ago
Storing auxiliary data for efficient maintenance and lineage tracing of complex views
As views in a data warehouse become more complex, the view maintenance process can become very complicated and potentially very inefficient. Storing auxiliary views in the warehou...
Yingwei Cui, Jennifer Widom
ICALP
2001
Springer
14 years 2 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
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
14 years 1 months ago
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Rafi Heiman, Avi Wigderson