Sciweavers

13987 search results - page 254 / 2798
» The Two Guards Problem
Sort
View
EMNLP
2011
14 years 4 months ago
Entire Relaxation Path for Maximum Entropy Problems
We discuss and analyze the problem of finding a distribution that minimizes the relative entropy to a prior distribution while satisfying max-norm constraints with respect to an ...
Moshe Dubiner, Yoram Singer
DAC
1999
ACM
16 years 5 months ago
Optimization-Intensive Watermarking Techniques for Decision Problems
Recently, a number of watermarking-based intellectual property protection techniques have been proposed. Although they have been applied to different stages in the design process ...
Gang Qu, Jennifer L. Wong, Miodrag Potkonjak
CHI
2006
ACM
16 years 4 months ago
The project fragmentation problem in personal information management
The project fragmentation problem in personal information management occurs when someone who is working on a single project stores and retrieves information items relating to that...
Ofer Bergman, Ruth Beyth-Marom, Rafi Nachmias
MOBIHOC
2001
ACM
16 years 3 months ago
A probabilistic analysis for the range assignment problem in ad hoc networks
In this paper we consider the following problem for ad hoc networks: assume that n nodes are distributed in a d-dimensional region, with 1d3, and assume that all the nodes have th...
Paolo Santi, Douglas M. Blough, Feodor S. Vainstei...
SODA
2010
ACM
167views Algorithms» more  SODA 2010»
16 years 1 months ago
Inapproximability for planar embedding problems
We consider the problem of computing a minimumdistortion bijection between two point-sets in R2 . We prove the first non-trivial inapproximability result for this problem, for the...
Jeff Edmonds, Anastasios Sidiropoulos, Anastasios ...