Sciweavers

6269 search results - page 230 / 1254
» Turning data into knowledge
Sort
View
DAGSTUHL
1996
15 years 6 months ago
Competitive Analysis of Distributed Algorithms
Abstract. Most applications of competitive analysis have involved online problems where a candidate on-line algorithm must compete on some input sequence against an optimal o -line...
James Aspnes
AR
2010
159views more  AR 2010»
15 years 5 months ago
Odometry Correction Using Visual Slip Angle Estimation for Planetary Exploration Rovers
This paper introduces a novel method for slip angle estimation based on visually observing the traces produced by the wheels of a robot on soft, deformable terrain. The proposed a...
Giulio Reina, Genya Ishigami, Keiji Nagatani, Kazu...
CORR
2010
Springer
70views Education» more  CORR 2010»
15 years 5 months ago
Structured sparsity-inducing norms through submodular functions
Sparse methods for supervised learning aim at finding good linear predictors from as few variables as possible, i.e., with small cardinality of their supports. This combinatorial ...
Francis Bach
JFP
2008
75views more  JFP 2008»
15 years 5 months ago
Exploiting reachability and cardinality in higher-order flow analysis
t two complementary improvements for abstract-interpretation-based flow analysis r-order languages: (1) abstract garbage collection and (2) abstract counting.1,2 garbage collecti...
Matthew Might, Olin Shivers
JODS
2007
142views Data Mining» more  JODS 2007»
15 years 5 months ago
Context Dependency Management in Ontology Engineering: A Formal Approach
Abstract. A viable ontology engineering methodology requires supporting domain experts in gradually building and managing increasingly complex versions of ontological elements and ...
Pieter De Leenheer, Aldo de Moor, Robert Meersman