2612 search results - page 235 / 523 » Switching Graphs and Their Complexity |
165
click to vote
TCOM
2011
15 years 24 days ago
2011
—Low-density parity-check (LDPC) codes are gaining interest for high data rate applications in both terrestrial and spatial communications. They can be designed and studied throu...
209
Voted
KI
2010
Springer
15 years 19 days ago
2010
Springer
In this paper, we address the problem of lifelong map learning in static environments with mobile robots using the graph-based formulation of the simultaneous localization and mapp...
252
Voted
COMPSYSTECH
2011
14 years 5 months ago
2011
Abstract. In a software watermarking environment, several graph theoretic watermark methods encode the watermark values as graph structures and embed them in application programs. ...
151
click to vote
ICIP
2002
IEEE
16 years 7 months ago
2002
IEEE
Transform approximations are explored for speeding up the software compression of images and video. Faster approximations are used to replace the regular DCT whenever only few DCT...
164
click to vote
VLSID
2006
IEEE
16 years 6 months ago
2006
IEEE
Serial links in network on chip provide advantages in terms of reduced wiring area, reduced switch complexity and power. However, serial links offer lower bandwidth in comparison ...