Sciweavers

89222 search results - page 9 / 17845
» Which
Sort
View
ICANN
2005
Springer
14 years 2 months ago
SOM of SOMs: Self-organizing Map Which Maps a Group of Self-organizing Maps
This paper aims to propose an extension of SOMs called an “SOM of SOMs,” or SOM¾ , in which the mapped objects are self-organizing maps themselves. In SOM¾ , each nodal unit ...
Tetsuo Furukawa
ISAAC
2003
Springer
125views Algorithms» more  ISAAC 2003»
14 years 2 months ago
A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact
Abstract Given an edge-weighted transportation network G and a list of transportation requests L, the Stacker Crane Problem is to find a minimum-cost tour for a server along the e...
Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhof...
ISMAR
2002
IEEE
14 years 1 months ago
MR Platform: A Basic Body on Which Mixed Reality Applications Are Built
This paper describes a platform package, called “MR Platform,” which we have been implementing for research and development of augmented reality technology and applications. T...
Shinji Uchiyama, Kazuki Takemoto, Kiyohide Satoh, ...
STOC
1993
ACM
121views Algorithms» more  STOC 1993»
14 years 26 days ago
On the generation of multivariate polynomials which are hard to factor
In this paper we consider the di culty of factoring multivariate polynomials F(x y z :::) modulo n. We consider in particular the case in which F is a product of two randomly chose...
Adi Shamir
AAAI
1998
13 years 10 months ago
Which Search Problems Are Random?
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
Tad Hogg