Sciweavers

1263 search results - page 5 / 253
» A* with Bounded Costs
Sort
View
COMBINATORICS
2002
90views more  COMBINATORICS 2002»
14 years 9 months ago
Ternary Constant Weight Codes
Let A3(n, d, w) denote the maximum cardinality of a ternary code with length n, minimum distance d, and constant Hamming weight w. Methods for proving upper and lower bounds on A3...
Patric R. J. Östergård, Mattias Svanstr...
WEA
2005
Springer
109views Algorithms» more  WEA 2005»
15 years 3 months ago
Synchronization Fault Cryptanalysis for Breaking A5/1
Abstract. A5/1 pseudo-random bit generator, known from GSM networks, potentially might be used for different purposes, such as secret hiding during cryptographic hardware testing, ...
Marcin Gomulkiewicz, Miroslaw Kutylowski, Heinrich...
HICSS
2007
IEEE
154views Biometrics» more  HICSS 2007»
15 years 3 months ago
Gulliver-A Framework for Building Smart Speech-Based Applications
Speech recognition has matured over the past years to the point that companies can seriously consider its use. However, from a developer’s perspective we observe that speech inp...
Werner Kurschl, Stefan Mitsch, Rene Prokop, Johann...
PAMI
2006
181views more  PAMI 2006»
14 years 9 months ago
Optimal Surface Segmentation in Volumetric Images-A Graph-Theoretic Approach
Efficient segmentation of globally optimal surfaces representing object boundaries in volumetric data sets is important and challenging in many medical image analysis applications....
Kang Li, Xiaodong Wu, Danny Z. Chen, Milan Sonka
IFIP
2004
Springer
15 years 3 months ago
PolyA: True Type Polymorphism for Mobile Ambients
Previous type systems for mobility calculi (the original Mobile Ambients, its variants and descendants, e.g., Boxed Ambients and Safe Ambients, and other related systems) offer lit...
Torben Amtoft, Henning Makholm, J. B. Wells