Sciweavers

197 search results - page 19 / 40
» Answering complex questions with random walk models
Sort
View
ECCV
2010
Springer
15 years 2 months ago
On Parameter Learning in CRF-based Approaches to Object Class Image Segmentation
Recent progress in per-pixel object class labeling of natural images can be attributed to the use of multiple types of image features and sound statistical learning approaches. Wit...
88
Voted
SDM
2007
SIAM
171views Data Mining» more  SDM 2007»
14 years 11 months ago
A Better Alternative to Piecewise Linear Time Series Segmentation
Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality,...
Daniel Lemire
97
Voted
ASIACRYPT
2010
Springer
14 years 7 months ago
Lattice-Based Blind Signatures
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...
Markus Rückert
ESA
2011
Springer
260views Algorithms» more  ESA 2011»
13 years 9 months ago
On Variants of the Matroid Secretary Problem
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the “rando...
Shayan Oveis Gharan, Jan Vondrák
92
Voted
CPM
2004
Springer
107views Combinatorics» more  CPM 2004»
15 years 1 months ago
Sorting by Reversals in Subquadratic Time
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
Eric Tannier, Marie-France Sagot