Sciweavers

335 search results - page 5 / 67
» Volume Queries in Polyhedra
Sort
View
CCCG
2003
13 years 8 months ago
On the Complexity of Halfspace Volume Queries
Given a polyhedron P in Rd with n vertices, a halfspace volume query asks for the volume of P ∩ H for a given halfspace H. We show that, for d ≥ 3, such queries can require â„...
Erik D. Demaine, Jeff Erickson, Stefan Langerman
GD
2009
Springer
13 years 5 months ago
Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...
Ioannis Z. Emiris, Elias P. Tsigaridas, Antonios V...
JUCS
2010
89views more  JUCS 2010»
13 years 2 months ago
A Geometrically Enhanced Conceptual Model and Query Language
: Motivated by our experiences with spatial modelling for the sustainable land use initiative we present a geometrically enhanced ER model (GERM), which preserves the key principle...
Hui Ma
VLDB
1999
ACM
120views Database» more  VLDB 1999»
13 years 11 months ago
A Novel Index Supporting High Volume Data Warehouse Insertion
While the desire to support fast, ad hoc query processing for large data warehouses has motivated the
Chris Jermaine, Anindya Datta, Edward Omiecinski
ADMA
2006
Springer
101views Data Mining» more  ADMA 2006»
14 years 1 months ago
ZED: Explaining Temporal Variations in Query Volume
We hypothesize that the variance in volume of high-velocity queries over time can be explained by observing that these queries are formulated in response to events in the world tha...
Maojin Jiang, Shlomo Argamon, Abdur Chowdhury, Kus...