Sciweavers

2913 search results - page 287 / 583
» How Much to Copy
Sort
View
NETWORKS
2011
14 years 11 months ago
Line planning, path constrained network flow and inapproximability
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
Christina Büsing, Sebastian Stiller
103
Voted
DESIRE
2010
14 years 11 months ago
Investigating visual analogies for visual insight problems
Much research has focused on the impact of analogies in insight problem solving, but less work has investigated how the visual analogies for insight are actually constructed. Thus...
Corina Sas, Eric Luchian, Linden J. Ball
149
Voted
SYNTHESE
2011
72views more  SYNTHESE 2011»
14 years 11 months ago
Science without (parametric) models: the case of bootstrap resampling
Scientific and statistical inferences build heavily on explicit, parametric models, and often with good reasons. However, the limited scope of parametric models and the increasin...
Jan Sprenger
TCS
2011
14 years 11 months ago
Two faces of active learning
An active learner has a collection of data points, each with a label that is initially hidden but can be obtained at some cost. Without spending too much, it wishes to find a cla...
Sanjoy Dasgupta
TCSV
2011
14 years 11 months ago
Background Compensation for Pan-Tilt-Zoom Cameras Using 1-D Feature Matching and Outlier Rejection
This paper proposes an efficient and robust background compensation method for pan-tilt-zoom cameras. The proposed method approximates the relation between consecutive images to a...
Jae Kyu Suhr, Ho Gi Jung, Gen Li, Seung-In Noh, Ja...