Sciweavers

6274 search results - page 328 / 1255
» From query complexity to computational complexity
Sort
View
DOCENG
2005
ACM
15 years 8 months ago
An environment for maintaining computation dependency in XML documents
In the domain of XML authoring, there have been many tools to help users to edit XML documents. These tools make it easier to produce complex documents by using such technologies ...
Dongxi Liu, Zhenjiang Hu, Masato Takeichi
CVPR
2008
IEEE
16 years 8 months ago
FuzzyMatte: A computationally efficient scheme for interactive matting
In this paper, we propose an online interactive matting algorithm, which we call FuzzyMatte. Our framework is based on computing the fuzzy connectedness (FC) [20] from each unknow...
Yuanjie Zheng, Chandra Kambhamettu, Jingyi Yu, Tho...
NC
2011
201views Neural Networks» more  NC 2011»
15 years 1 months ago
The computational power of membrane systems under tight uniformity conditions
We apply techniques from complexity theory to a model of biological cellular membranes known as membrane systems or P-systems. Like Boolean circuits, membrane systems are defined ...
Niall Murphy, Damien Woods
PODS
2006
ACM
138views Database» more  PODS 2006»
16 years 6 months ago
Efficiently ordering subgoals with access constraints
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
Guizhen Yang, Michael Kifer, Vinay K. Chaudhri
WG
2004
Springer
16 years 1 days ago
Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs
The Phylogenetic kth Root Problem (PRk) is the problem of finding a (phylogenetic) tree T from a given graph G = (V, E) such that (1) T has no degree-2 internal nodes, (2) the ex...
Zhi-Zhong Chen, Tatsuie Tsukiji