Sciweavers

855 search results - page 61 / 171
» Complexity of Equations over Sets of Natural Numbers
Sort
View
CIKM
2009
Springer
15 years 4 months ago
Reducing the risk of query expansion via robust constrained optimization
We introduce a new theoretical derivation, evaluation methods, and extensive empirical analysis for an automatic query expansion framework in which model estimation is cast as a r...
Kevyn Collins-Thompson
MICCAI
2000
Springer
15 years 1 months ago
Small Sample Size Learning for Shape Analysis of Anatomical Structures
We present a novel approach to statistical shape analysis of anatomical structures based on small sample size learning techniques. The high complexity of shape models used in medic...
Polina Golland, W. Eric L. Grimson, Martha Elizabe...
TVCG
2010
188views more  TVCG 2010»
14 years 8 months ago
Analyzing and Tracking Burning Structures in Lean Premixed Hydrogen Flames
— This paper presents topology-based methods to robustly extract, analyze, and track features defined as subsets of isosurfaces. First, we demonstrate how features identified b...
Peer-Timo Bremer, Gunther H. Weber, Valerio Pascuc...
COLT
2008
Springer
14 years 11 months ago
Regret Bounds for Sleeping Experts and Bandits
We study on-line decision problems where the set of actions that are available to the decision algorithm vary over time. With a few notable exceptions, such problems remained larg...
Robert D. Kleinberg, Alexandru Niculescu-Mizil, Yo...
FM
2009
Springer
124views Formal Methods» more  FM 2009»
15 years 4 months ago
An Incremental Approach to Scope-Bounded Checking Using a Lightweight Formal Method
We present a novel approach to optimize scope-bounded checking programs using a relational constraint solver. Given a program and its correctness specification, the traditional app...
Danhua Shao, Sarfraz Khurshid, Dewayne E. Perry