Sciweavers

1026 search results - page 77 / 206
» On Finding Minimal w-cutset
Sort
View
EWC
2010
178views more  EWC 2010»
14 years 7 months ago
Design of tensegrity structures using parametric analysis and stochastic search
Tensegrity structures are lightweight structures composed of cables in tension and struts in compression. Since tensegrity systems exhibit geometrically nonlinear behavior, findin...
Landolf Rhode-Barbarigos, Himanshu Jain, Prakash K...
PODS
2002
ACM
98views Database» more  PODS 2002»
15 years 10 months ago
On Propagation of Deletions and Annotations Through Views
We study two classes of view update problems in relational databases. We are given a source database S, a monotone query Q, and the view Q(S) generated by the query. The first pro...
Peter Buneman, Sanjeev Khanna, Wang Chiew Tan
EDBT
2004
ACM
147views Database» more  EDBT 2004»
15 years 10 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...
TMC
2012
13 years 6 days ago
Fast Data Collection in Tree-Based Wireless Sensor Networks
—We investigate the following fundamental question—how fast can information be collected from a wireless sensor network organized as tree? To address this, we explore and evalu...
Özlem Durmaz Incel, Amitabha Ghosh, Bhaskar K...
ISSAC
1998
Springer
101views Mathematics» more  ISSAC 1998»
15 years 2 months ago
Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
Markus A. Hitz, Erich Kaltofen