Sciweavers

1068 search results - page 119 / 214
» Factorization as a Rank 1 Problem
Sort
View
GLOBECOM
2006
IEEE
15 years 4 months ago
Connection Preemption in Multi-Class Networks
— We address the problem of connection preemption in a multi-class network environment. Our objective is: i) to minimize the number of preempted connections, and ii) to minimize ...
Fahad Rafique Dogar, Laeeq Aslam, Zartash Afzal Uz...
ASPDAC
2004
ACM
141views Hardware» more  ASPDAC 2004»
15 years 3 months ago
An approach for reducing dynamic power consumption in synchronous sequential digital designs
— The problem of minimizing dynamic power consumption by scaling down the supply voltage of computational elements off critical paths is widely addressed in the literature for th...
Noureddine Chabini, Wayne Wolf
ECCC
2008
108views more  ECCC 2008»
14 years 10 months ago
The Complexity of Rationalizing Matchings
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...
Shankar Kalyanaraman, Christopher Umans
SDM
2010
SIAM
168views Data Mining» more  SDM 2010»
14 years 8 months ago
Convex Principal Feature Selection
A popular approach for dimensionality reduction and data analysis is principal component analysis (PCA). A limiting factor with PCA is that it does not inform us on which of the o...
Mahdokht Masaeli, Yan Yan, Ying Cui, Glenn Fung, J...
COCOON
2011
Springer
13 years 9 months ago
Finding Paths with Minimum Shared Edges
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
Masoud T. Omran, Jörg-Rüdiger Sack, Hami...