Sciweavers

393 search results - page 26 / 79
» Convex Programming Methods for Global Optimization
Sort
View
DATE
2003
IEEE
79views Hardware» more  DATE 2003»
14 years 26 days ago
Time Budgeting in a Wireplanning Context
Wireplanning is an approach in which the timing of inputoutput paths is planned before modules are specified, synthesized or sized. If these global wires are optimally segmented ...
Jurjen Westra, Dirk-Jan Jongeneel, Ralph H. J. M. ...
COR
2002
90views more  COR 2002»
13 years 7 months ago
Extremist vs. centrist decision behavior: quasi-convex utility functions for interactive multi-objective linear programming prob
This paper presents the fundamental theory and algorithms for identifying the most preferred alternative for a decision maker (DM) having a non-centrist (or extremist) preferentia...
Behnam Malakooti, Jumah E. Al-alwani
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 7 months ago
On the Convexity of Latent Social Network Inference
In many real-world scenarios, it is nearly impossible to collect explicit social network data. In such cases, whole networks must be inferred from underlying observations. Here, w...
Seth A. Myers, Jure Leskovec
TIP
1998
159views more  TIP 1998»
13 years 7 months ago
An optimal quadtree-based motion estimation and motion-compensated interpolation scheme for video compression
Abstract—In this paper, we propose an optimal quadtree (QT)based motion estimator for video compression. It is optimal in the sense that for a given bit budget for encoding the d...
Guido M. Schuster, Aggelos K. Katsaggelos
JSAC
2008
111views more  JSAC 2008»
13 years 7 months ago
The end-to-end rate control in multiple-hop wireless networks: Cross-layer formulation and optimal allocation
In this paper, we study the theoretical problem of the end-to-end rate assignment for multi-hop wireless networks. Specifically, we consider the problem of joint congestion control...
Chengnian Long, Bo Li, Qian Zhang, Bin Zhao, Bo Ya...