Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
28
search results - page 3 / 6
»
cpm 2008
Sort
relevance
views
votes
recent
update
View
thumb
title
35
click to vote
CPM
2008
Springer
170
views
Combinatorics
»
more
CPM 2008
»
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
14 years 19 days ago
Download
www.cs.ucr.edu
Nadja Betzler, Michael R. Fellows, Christian Komus...
claim paper
Read More »
20
click to vote
CPM
2008
Springer
129
views
Combinatorics
»
more
CPM 2008
»
Fast Algorithms for Computing Tree LCS
14 years 19 days ago
Download
www.cs.bgu.ac.il
Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-U...
claim paper
Read More »
31
click to vote
TCOM
2008
86
views
more
TCOM 2008
»
PAM representation of ternary CPM
13 years 10 months ago
Download
people.eecs.ku.edu
This letter considers the pulse amplitude modulation (PAM) representation of continuous phase modulation (CPM) with a ternary data alphabet. This technique is applied to the proble...
Erik Perrins, Michael Rice
claim paper
Read More »
11
click to vote
GLOBECOM
2008
IEEE
88
views
Communications
»
more
GLOBECOM 2008
»
Full Rate L2-Orthogonal Space-Time CPM for Three Antennas
14 years 5 months ago
Download
hal.archives-ouvertes.fr
Matthias Hesse, Jérôme Lebrun, Luc De...
claim paper
Read More »
25
click to vote
CPM
2008
Springer
149
views
Combinatorics
»
more
CPM 2008
»
On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices
14 years 19 days ago
Download
hpc.isti.cnr.it
Let G be an unweighted and undirected graph of n nodes, and let D be the n
Igor Nitto, Rossano Venturini
claim paper
Read More »
« Prev
« First
page 3 / 6
Last »
Next »