Sciweavers

413 search results - page 34 / 83
» Computing and Exploiting Tree-Decompositions for Solving Con...
Sort
View
ESA
2007
Springer
118views Algorithms» more  ESA 2007»
15 years 7 months ago
A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this pro...
Markus Chimani, Maria Kandyba, Petra Mutzel
ICCV
2003
IEEE
16 years 3 months ago
Tracking Articulated Body by Dynamic Markov Network
A new method for visual tracking of articulated objects is presented. Analyzing articulated motion is challenging because the dimensionality increase potentially demands tremendou...
Ying Wu, Gang Hua, Ting Yu
ICCCN
2008
IEEE
15 years 7 months ago
Energy Minimization through Network Coding for Lifetime Constrained Wireless Networks
— Energy management is the key issue in the design and operation of wireless network applications like sensor networks, pervasive computing and ubiquitous computing where the net...
Nishanth Gaddam, Sudha Anil Gathala, David Lastine...
AGP
2003
IEEE
15 years 6 months ago
Interpreting Abduction in CLP
Constraint Logic Programming (CLP) and Abductive Logic Programming (ALP) share the important concept of conditional answer. We exploit their deep similarities to implement an effic...
Marco Gavanelli, Evelina Lamma, Paola Mello, Miche...
COR
2007
106views more  COR 2007»
15 years 1 months ago
On a stochastic sequencing and scheduling problem
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...
Antonio Alonso-Ayuso, Laureano F. Escudero, M. Ter...