1529 search results - page 46 / 306 » A slant removal algorithm |
IPL
2007
14 years 9 months ago
2007
The disk dimension of a planar graph G is the least number k for which G embeds in the plane minus k open disks, with every vertex on the boundary of some disk. Useful properties ...
CIBCB
2005
IEEE
15 years 3 months ago
2005
IEEE
— Hannenhalli and Pevzner developed the first polynomial-time algorithm for the combinatorial problem of sorting of signed genomic data. Their algorithm solves the minimum numbe...
ISCC
2002
IEEE
15 years 2 months ago
2002
IEEE
We discuss techniques for Voice Activity Detection (VAD) for Voice over Internet Protocol (VoIP). VAD aids in saving bandwidth requirement of a voice session thereby increasing th...
STOC
1998
ACM
15 years 2 months ago
1998
ACM
Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Mult...
WSCG
2004
14 years 11 months ago
2004
A public-key asymmetric robust watermarking algorithm based on signal with special correlation characteristic is proposed in this paper. This algorithm is designed to permit pubic...