Sciweavers

1960 search results - page 53 / 392
» The Logic of Large Enough
Sort
View
ILP
2007
Springer
14 years 1 months ago
Using Bayesian Networks to Direct Stochastic Search in Inductive Logic Programming
Stochastically searching the space of candidate clauses is an appealing way to scale up ILP to large datasets. We address an approach that uses a Bayesian network model to adaptive...
Louis Oliphant, Jude W. Shavlik
CVPR
2010
IEEE
14 years 3 months ago
Unified Real-Time Tracking and Recognition with Rotation-Invariant Fast Features
We present a method that unifies tracking and video content recognition with applications to Mobile Augmented Reality (MAR). We introduce the Radial Gradient Transform (RGT) and ...
Gabriel Takacs, Vijay Chandrasekhar, Sam Tsai, Dav...
ROBOCUP
2007
Springer
89views Robotics» more  ROBOCUP 2007»
14 years 1 months ago
Region-Based Segmentation with Ambiguous Color Classes and 2-D Motion Compensation
This paper presents a new approach for color segmentation, in which colors are not only mapped to unambiguous but also to ambiguous color classes. The ambiguous color classes are r...
Thomas Röfer
COMPGEOM
2003
ACM
14 years 1 months ago
Incremental constructions con BRIO
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
Nina Amenta, Sunghee Choi, Günter Rote
CORR
2010
Springer
134views Education» more  CORR 2010»
13 years 7 months ago
Where is Randomness Needed to Break the Square-Root Bottleneck?
As shown by Tropp, 2008, for the concatenation of two orthonormal bases (ONBs), breaking the square-root bottleneck in compressed sensing does not require randomization over all th...
Patrick Kuppinger, Giuseppe Durisi, Helmut Bö...