Sciweavers

1429 search results - page 267 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
JMLR
2008
168views more  JMLR 2008»
13 years 7 months ago
Max-margin Classification of Data with Absent Features
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
Gal Chechik, Geremy Heitz, Gal Elidan, Pieter Abbe...
INFORMS
1998
100views more  INFORMS 1998»
13 years 7 months ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...
TCSV
2002
69views more  TCSV 2002»
13 years 7 months ago
Optimizing channel allocation in a unified video-on-demand system
Unified video-on-demand (UVoD) is a recently proposed architecture that integrates multicast transmission with unicast transmission to improve system efficiency. Streaming channels...
Jack Y. B. Lee
SIGMOD
2011
ACM
276views Database» more  SIGMOD 2011»
12 years 10 months ago
Schedule optimization for data processing flows on the cloud
Scheduling data processing workflows (dataflows) on the cloud is a very complex and challenging task. It is essentially an optimization problem, very similar to query optimizati...
Herald Kllapi, Eva Sitaridi, Manolis M. Tsangaris,...
PODC
2009
ACM
14 years 8 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...