Sciweavers

4488 search results - page 218 / 898
» Focusing Search by Using Problem Solving Experience
Sort
View
ICCBR
2009
Springer
15 years 1 months ago
Constraint-Based Case-Based Planning Using Weighted MAX-SAT
Previous approaches to case-based planning often finds a similar plan case to a new planning problem to adapt to solve the new problem. However, in the case base, there may be some...
Hankui Zhuo, Qiang Yang, Lei Li
CORR
2002
Springer
111views Education» more  CORR 2002»
15 years 3 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter
MM
2010
ACM
152views Multimedia» more  MM 2010»
15 years 4 months ago
Content without context is meaningless
We revisit one of the most fundamental problems in multimedia that is receiving enormous attention from researchers without making much progress in solving it: the problem of brid...
Ramesh Jain, Pinaki Sinha
138
Voted
CORR
2010
Springer
255views Education» more  CORR 2010»
15 years 4 months ago
Scalable Tensor Factorizations for Incomplete Data
The problem of incomplete data--i.e., data with missing or unknown values--in multi-way arrays is ubiquitous in biomedical signal processing, network traffic analysis, bibliometri...
Evrim Acar, Tamara G. Kolda, Daniel M. Dunlavy, Mo...
CVPR
2007
IEEE
16 years 6 months ago
Approximate Nearest Subspace Search with Applications to Pattern Recognition
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor