Sciweavers

2100 search results - page 114 / 420
» Fundamentals of the problem
Sort
View
IDEAL
2010
Springer
15 years 5 months ago
Applying Clustering Techniques to Reduce Complexity in Automated Planning Domains
Automated Planning is a very active area of research within Artificial Intelligence. Broadly this discipline deals with the methods by which an agent can independently determine t...
Luke Dicken, John Levine
IJRR
2010
114views more  IJRR 2010»
15 years 5 months ago
Generating Uniform Incremental Grids on SO(3) Using the Hopf Fibration
Abstract The problem of generating uniform deterministic samples over the rotation group, SO(3), is fundamental to many fields, such as computational structural biology, robotics,...
Anna Yershova, Swati Jain, Steven M. LaValle, Juli...
PERCOM
2010
ACM
15 years 4 months ago
Cloud-assisted mobile desktop search
—With the advent of the Internet, searching for information became a fundamental part of our daily computing. When large storage devices were integrated to our personal computers...
Eemil Lagerspetz, Sasu Tarkoma
TIT
2011
121views more  TIT 2011»
15 years 1 months ago
Strongly Consistent Estimation of the Sample Distribution of Noisy Continuous-Parameter Fields
The general problem of defining and determining the sample distribution in the case of continuousparameter random fields, is addressed. Defining a distribution in the case of d...
Shahar Z. Kovalsky, Guy Cohen, Joseph M. Francos
JMIV
2010
78views more  JMIV 2010»
15 years 1 months ago
Unified Computation of Strict Maximum Likelihood for Geometric Fitting
A new numerical scheme is presented for strictly computing maximum likelihood (ML) of geometric fitting problems. Intensively studied in the past are those methods that first tran...
Kenichi Kanatani, Yasuyuki Sugaya