Sciweavers

1859 search results - page 251 / 372
» Using Problems to Learn Service-Oriented Computing
Sort
View
CP
2009
Springer
15 years 11 months ago
Why Cumulative Decomposition Is Not as Bad as It Sounds
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, M...
KDD
2004
ACM
196views Data Mining» more  KDD 2004»
16 years 5 months ago
Adversarial classification
Essentially all data mining algorithms assume that the datagenerating process is independent of the data miner's activities. However, in many domains, including spam detectio...
Nilesh N. Dalvi, Pedro Domingos, Mausam, Sumit K. ...
CVPR
2005
IEEE
16 years 7 months ago
Restoration and Recognition in a Loop
In this paper we present a novel learning based method for restoring and recognizing images of digits that have been blurred using an unknown kernel. The novelty of our work is an...
Mithun Das Gupta, ShyamSundar Rajaram, Nemanja Pet...
CVPR
2008
IEEE
16 years 7 months ago
Interactive image segmentation via minimization of quadratic energies on directed graphs
We propose a scheme to introduce directionality in the Random Walker algorithm for image segmentation. In particular, we extend the optimization framework of this algorithm to com...
Dheeraj Singaraju, Leo Grady, René Vidal
ECCV
2002
Springer
16 years 6 months ago
Robust Parameterized Component Analysis
Principal ComponentAnalysis (PCA) has been successfully applied to construct linear models of shape, graylevel, and motion. In particular, PCA has been widely used to model the var...
Fernando De la Torre, Michael J. Black