1949 search results - page 338 / 390 » Random graphs on surfaces |
138
click to vote
JAT
2010
15 years 2 months ago
2010
We consider H¨older smoothness classes of surfaces for which we construct piecewise polynomial approximation networks, which are graphs with polynomial pieces as nodes and edges ...
123
Voted
DAC
2000
ACM
16 years 4 months ago
2000
ACM
Recently, intellectual property protection (IPP) techniques attracted a great deal of attention from semiconductor, system integration and software companies. A number of watermar...
129
Voted
WWW
2007
ACM
16 years 4 months ago
2007
ACM
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
121
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
137
click to vote
EUROSYS
2006
ACM
16 years 1 months ago
2006
ACM
—Restoring data operations after a disaster is a daunting task: how should recovery be performed to minimize data loss and application downtime? Administrators are under consider...