Sciweavers

4526 search results - page 708 / 906
» Algorithmic problems related to the Internet
Sort
View
NPAR
2004
ACM
15 years 9 months ago
Example-based composite sketching of human portraits
Creating a portrait in the style of a particular artistic tradition or a particular artist is a difficult problem. Elusive to codify algorithmically, the nebulous qualities which...
Hong Chen, Ziqiang Liu, Chuck Rose, Yingqing Xu, H...
GG
2004
Springer
15 years 9 months ago
Embedding in Switching Classes with Skew Gains
Abstract. In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labe...
Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Gr...
JELIA
2004
Springer
15 years 9 months ago
Representation and Complexity in Boolean Games
Boolean games are a class of two-player games which may be defined via a Boolean form over a set of atomic actions. A particular game on some form is instantiated by partitioning ...
Paul E. Dunne, Wiebe van der Hoek
DATE
2010
IEEE
171views Hardware» more  DATE 2010»
15 years 9 months ago
Statistical static timing analysis using Markov chain Monte Carlo
—We present a new technique for statistical static timing analysis (SSTA) based on Markov chain Monte Carlo (MCMC), that allows fast and accurate estimation of the right-hand tai...
Yashodhan Kanoria, Subhasish Mitra, Andrea Montana...
FOCS
2002
IEEE
15 years 9 months ago
The Partition Technique for Overlays of Envelopes
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
Vladlen Koltun, Micha Sharir