Sciweavers

1082 search results - page 169 / 217
» Stability of Locally Optimal Solutions
Sort
View
CSDA
2010
132views more  CSDA 2010»
14 years 12 months ago
Approximate low-rank factorization with structured factors
An approximate rank revealing factorization problem with structure constraints on the normalized factors is considered. Examples of structure, motivated by an application in micro...
Ivan Markovsky, Mahesan Niranjan
IJNSEC
2008
152views more  IJNSEC 2008»
14 years 11 months ago
Group Key Management in MANETs
Specific applications like military or public emergency ones require secure group communication in ad hoc environments. The most suitable solution to provide the expected level of...
Mohamed Salah Bouassida, Isabelle Chrisment, Olivi...
IEICET
2006
55views more  IEICET 2006»
14 years 11 months ago
Inserting Points Uniformly at Every Instance
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...
Sachio Teramoto, Tetsuo Asano, Naoki Katoh, Benjam...
IJFCS
2006
82views more  IJFCS 2006»
14 years 11 months ago
Routing Multiple Width Communications on the Circuit Switched Tree
Dynamically reconfigurable architectures offer extremely fast solutions to various problems. The Circuit Switched Tree (CST) is an important interconnect used to implement such ar...
Krishnendu Roy, Ramachandran Vaidyanathan, Jerry L...
AROBOTS
2002
91views more  AROBOTS 2002»
14 years 11 months ago
Fast, On-Line Learning of Globally Consistent Maps
To navigate in unknown environments, mobile robots require the ability to build their own maps. A major problem for robot map building is that odometry-based dead reckoning cannot ...
Tom Duckett, Stephen Marsland, Jonathan Shapiro