Sciweavers

1951 search results - page 374 / 391
» An algorithm for improving graph partitions
Sort
View
EMNLP
2010
14 years 8 months ago
Practical Linguistic Steganography Using Contextual Synonym Substitution and Vertex Colour Coding
Linguistic Steganography is concerned with hiding information in natural language text. One of the major transformations used in Linguistic Steganography is synonym substitution. ...
Ching-Yun Chang, Stephen Clark
JMLR
2010
165views more  JMLR 2010»
14 years 4 months ago
Learning with Blocks: Composite Likelihood and Contrastive Divergence
Composite likelihood methods provide a wide spectrum of computationally efficient techniques for statistical tasks such as parameter estimation and model selection. In this paper,...
Arthur Asuncion, Qiang Liu, Alexander T. Ihler, Pa...
ALGORITHMICA
2011
14 years 5 months ago
On Bounded Leg Shortest Paths Problems
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
Liam Roditty, Michael Segal
SODA
2010
ACM
231views Algorithms» more  SODA 2010»
15 years 7 months ago
Asymmetric Traveling Salesman Path and Directed Latency Problems
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
Zachary Friggstad, Mohammad R. Salavatipour, Zoya ...
CORR
2010
Springer
152views Education» more  CORR 2010»
14 years 10 months ago
Deploying Wireless Networks with Beeps
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
Alejandro Cornejo, Fabian Kuhn