Sciweavers

968 search results - page 117 / 194
» A faster implementation of APlace
Sort
View
CVPR
2010
IEEE
16 years 17 days ago
Parallel and Distributed Graph Cuts by Dual Decomposition
Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...
Petter Strandmark, Fredrik Kahl
WWW
2010
ACM
15 years 11 months ago
Regular expressions considered harmful in client-side XSS filters
Cross-site scripting flaws have now surpassed buffer overflows as the world’s most common publicly-reported security vulnerability. In recent years, browser vendors and resea...
Daniel Bates, Adam Barth, Collin Jackson
CHI
2010
ACM
15 years 11 months ago
Example-centric programming: integrating web search into the development environment
The ready availability of online source code examples has changed the cost structure of programming by example modification. However, current search tools are wholly separate from...
Joel Brandt, Mira Dontcheva, Marcos Weskamp, Scott...
ICML
2009
IEEE
15 years 11 months ago
Using fast weights to improve persistent contrastive divergence
The most commonly used learning algorithm for restricted Boltzmann machines is contrastive divergence which starts a Markov chain at a data point and runs the chain for only a few...
Tijmen Tieleman, Geoffrey E. Hinton
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...