Sciweavers

1080 search results - page 21 / 216
» Problem dependent optimization (PDO)
Sort
View
ECCV
2010
Springer
15 years 6 months ago
Clustering Complex Data with Group-Dependent Feature Selection
Abstract. We describe a clustering approach with the emphasis on detecting coherent structures in a complex dataset, and illustrate its effectiveness with computer vision applicat...
SWAT
2010
Springer
204views Algorithms» more  SWAT 2010»
15 years 1 months ago
Feasible and Accurate Algorithms for Covering Semidefinite Programs
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...
Garud Iyengar, David J. Phillips, Clifford Stein
220
Voted
VLDB
2002
ACM
157views Database» more  VLDB 2002»
16 years 4 months ago
A formal perspective on the view selection problem
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
Rada Chirkova, Alon Y. Halevy, Dan Suciu
VLDB
2006
ACM
162views Database» more  VLDB 2006»
16 years 4 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
PRDC
2007
IEEE
15 years 10 months ago
RTG-L: Dependably Scheduling Real-Time Distributable Threads in Large-Scale, Unreliable Networks
We consider scheduling real-time distributable threads in the presence of node/link failures and message losses in large-scale network systems. We present a distributed scheduling...
Kai Han, Binoy Ravindran, E. Douglas Jensen