Sciweavers

1964 search results - page 304 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
105
Voted
AAAI
2006
15 years 4 months ago
Cost-Optimal External Planning
This paper considers strategies for external memory based optimal planning. An external breadth-first search exploration algorithm is devised that is guaranteed to find the costop...
Stefan Edelkamp, Shahid Jabbar
116
Voted
GVD
2004
107views Database» more  GVD 2004»
15 years 4 months ago
Conflation Methods and Spelling Mistakes - A Sensitivity Analysis in Information Retrieval
In some information retrieval scenarios, for example internal help desk systems, texts are entered into the document collection without proofreading. This can result in a relative...
Philipp Dopichaj, Theo Härder
AIPS
2010
15 years 2 months ago
Coming Up With Good Excuses: What to do When no Plan Can be Found
When using a planner-based agent architecture, many things can go wrong. First and foremost, an agent might fail to execute one of the planned actions for some reasons. Even more ...
Moritz Göbelbecker, Thomas Keller, Patrick Ey...
96
Voted
ICASSP
2010
IEEE
15 years 2 months ago
Simultaneous search for all modes in multilinear models
Parallel factor (PARAFAC) analysis is an extension of a low rank decomposition to higher way arrays, usually called tensors. Most of existing methods are based on an alternating l...
Petr Tichavský, Zbynek Koldovský
137
Voted
ICASSP
2010
IEEE
15 years 2 months ago
Learning from high-dimensional noisy data via projections onto multi-dimensional ellipsoids
In this paper, we examine the problem of learning from noisecontaminated data in high-dimensional space. A new learning approach based on projections onto multi-dimensional ellips...
Liuling Gong, Dan Schonfeld