Sciweavers

5115 search results - page 794 / 1023
» On Randomized Lanczos Algorithms
Sort
View
ICRA
2010
IEEE
142views Robotics» more  ICRA 2010»
15 years 4 months ago
A quadratic regulator-based heuristic for rapidly exploring state space
Abstract— Kinodynamic planning algorithms like RapidlyExploring Randomized Trees (RRTs) hold the promise of finding feasible trajectories for rich dynamical systems with complex...
Elena Leah Glassman, Russ Tedrake
ISI
2010
Springer
15 years 4 months ago
Measuring behavioral trust in social networks
Abstract—Trust is an important yet complex and little understood dyadic relation among actors in a social network. There are many dimensions to trust; trust plays an important ro...
Sibel Adali, Robert Escriva, Mark K. Goldberg, Myk...
KDD
2010
ACM
318views Data Mining» more  KDD 2010»
15 years 4 months ago
DivRank: the interplay of prestige and diversity in information networks
Information networks are widely used to characterize the relationships between data items such as text documents. Many important retrieval and mining tasks rely on ranking the dat...
Qiaozhu Mei, Jian Guo, Dragomir R. Radev
PAMI
2010
164views more  PAMI 2010»
15 years 4 months ago
Large-Scale Discovery of Spatially Related Images
— We propose a randomized data mining method that finds clusters of spatially overlapping images. The core of the method relies on the min-Hash algorithm for fast detection of p...
Ondrej Chum, Jiri Matas
PVLDB
2010
120views more  PVLDB 2010»
15 years 4 months ago
Sampling the Repairs of Functional Dependency Violations under Hard Constraints
Violations of functional dependencies (FDs) are common in practice, often arising in the context of data integration or Web data extraction. Resolving these violations is known to...
George Beskales, Ihab F. Ilyas, Lukasz Golab