Sciweavers

209 search results - page 16 / 42
» Decomposable Constraints
Sort
View
TDM
2004
128views Database» more  TDM 2004»
13 years 8 months ago
Processing Content-And-Structure Queries for XML Retrieval
Document-centric XML collections contain text-rich documents, marked up with XML tags. The tags add lightweight semantics to the text. Querying such collections calls for a hybrid...
Börkur Sigurbjörnsson, Jaap Kamps, Maart...
ICRA
2003
IEEE
122views Robotics» more  ICRA 2003»
14 years 23 days ago
Complementarity formulation for multi-fingered hand manipulation with rolling and sliding contacts
— We propose a novel complementarity model for a general three-dimensional manipulation system with rolling and sliding contacts to solve the forward dynamics problem. The key id...
Masahito Yashima, Hideya Yamaguchi
FOIKS
2008
Springer
13 years 9 months ago
Autonomous Sets - A Method for Hypergraph Decomposition with Applications in Database Theory
We present a method for decomposing a hypergraph with certain regularities into smaller hypergraphs. By applying this to the set of all canonical covers of a given set of functiona...
Henning Köhler
INFOCOM
1998
IEEE
13 years 11 months ago
QoS Routing in Networks with Uncertain Parameters
We consider the problem of routing connections with quality of service (QoS) requirements across networks when the information available for making routing decisions is inaccurate....
Dean H. Lorenz, Ariel Orda
CORR
2011
Springer
194views Education» more  CORR 2011»
13 years 2 months ago
Energy-Latency Tradeoff for In-Network Function Computation in Random Networks
—The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the ...
Paul N. Balister, Béla Bollobás, Ani...