697 search results - page 85 / 140 » On the Theory of Average Case Complexity |
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
HAPTICS
2003
IEEE
14 years 1 months ago
2003
IEEE
This paper describes a new technique for allowing multiple users to haptically interact with a set of deformable slowly-simulated objects in a stable manner. Stability has been ap...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
KDD
2009
ACM
14 years 2 months ago
2009
ACM
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...