210 search results - page 17 / 42 » On the Structure of Bounded Queries to Arbitrary NP Sets |
CGA
2005
13 years 8 months ago
2005
We propose new analytical formulations of bounded blending operations for the function-based constructive shape modeling. The blending set operations are defined using R-functions...
CPM
2006
Springer
14 years 10 days ago
2006
Springer
Abstract. Protein structure analysis is one of the most important research issues in the post-genomic era, and faster and more accurate query data structures for such 3-D structure...
STOC
2010
ACM
14 years 28 days ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
CORR
1998
Springer
13 years 8 months ago
1998
Springer
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
DBPL
1993
Springer
14 years 21 days ago
1993
Springer
In this paper we study the expressive power of query languages for nested bags. We de ne the ambient bag language by generalizing the constructs of the relational language of Brea...