Sciweavers

1760 search results - page 266 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
166
Voted
KDD
2012
ACM
194views Data Mining» more  KDD 2012»
13 years 7 months ago
A sparsity-inducing formulation for evolutionary co-clustering
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
Shuiwang Ji, Wenlu Zhang, Jun Liu
DATE
2006
IEEE
104views Hardware» more  DATE 2006»
15 years 10 months ago
Integrated placement and skew optimization for rotary clocking
—The clock distribution network is a key component of any synchronous VLSI design. High power dissipation and pressure volume temperature-induced variations in clock skew have st...
Ganesh Venkataraman, Jiang Hu, Frank Liu, Cliff C....
IPPS
2009
IEEE
15 years 11 months ago
Competitive buffer management with packet dependencies
We introduce the problem of managing a FIFO buffer of bounded space, where arriving packets have dependencies among them. Our model is motivated by the scenario where large data f...
Alexander Kesselman, Boaz Patt-Shamir, Gabriel Sca...
JMLR
2006
150views more  JMLR 2006»
15 years 4 months ago
Exact 1-Norm Support Vector Machines Via Unconstrained Convex Differentiable Minimization
Support vector machines utilizing the 1-norm, typically set up as linear programs (Mangasarian, 2000; Bradley and Mangasarian, 1998), are formulated here as a completely unconstra...
Olvi L. Mangasarian
ICCV
2009
IEEE
16 years 9 months ago
FLoSS: Facility Location for Subspace Segmentation
Subspace segmentation is the task of segmenting data lying on multiple linear subspaces. Its applications in computer vision include motion segmentation in video, structure-from...
Nevena Lazic, Inmar Givoni, Brendan Frey