Sciweavers

1289 search results - page 171 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
AROBOTS
2002
91views more  AROBOTS 2002»
14 years 9 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
COMCOM
1999
87views more  COMCOM 1999»
14 years 9 months ago
Virtual path layout in ATM networks based on the P-median problem
We study the problem of virtual path layout in ATM networks. Virtual path (VP) and virtual channel are used by the ATM networks in realizing multiplexing, resource management and ...
W. K. Lai, R. F. Chang
ACL
2010
14 years 8 months ago
Efficient Staggered Decoding for Sequence Labeling
The Viterbi algorithm is the conventional decoding algorithm most widely adopted for sequence labeling. Viterbi decoding is, however, prohibitively slow when the label set is larg...
Nobuhiro Kaji, Yasuhiro Fujiwara, Naoki Yoshinaga,...
CISIS
2010
IEEE
14 years 8 months ago
Scalable Grid Resource Trading with Greedy Heuristics
As Grid infrastructures become more widely used by the academic and commercial world, the problem of resource allocation increases in complexity. Resource trading markets are one m...
Georg Buss, Kevin Lee, Daniel Veit
ICIP
2010
IEEE
14 years 7 months ago
Complexity-scalable H.264/AVC in an IPP-based video encoder
Real-time high-definition video encoding is a computationhungry task that challenges software-based solutions. For that, in this work we adopted an Intel software implementation o...
Tiago A. da Fonseca, Ricardo L. de Queiroz, Debarg...