Sciweavers

855 search results - page 35 / 171
» Complexity of Equations over Sets of Natural Numbers
Sort
View
SIGGRAPH
1996
ACM
15 years 1 months ago
Flow and Changes in Appearance
An important, largely unexplored area of computer image generation is the simulation of weathering and its effects on appearance. Weathering results from the interaction of the en...
Julie Dorsey, Hans Køhling Pedersen, Pat Ha...
JELIA
2004
Springer
15 years 3 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
AUTOMATICA
2008
75views more  AUTOMATICA 2008»
14 years 9 months ago
Optimal complexity reduction of polyhedral piecewise affine systems
This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Fi...
Tobias Geyer, Fabio Danilo Torrisi, Manfred Morari
TCS
2010
14 years 8 months ago
A hierarchical strongly aperiodic set of tiles in the hyperbolic plane
We give a new construction of strongly aperiodic set of tiles in H2 , exhibiting a kind of hierarchical structure, simplifying the central framework of Margenstern’s proof that t...
Chaim Goodman-Strauss
ICDCS
2006
IEEE
15 years 3 months ago
ParRescue: Scalable Parallel Algorithm and Implementation for Biclustering over Large Distributed Datasets
Biclustering refers to simultaneously capturing correlations present among subsets of attributes (columns) and records (rows). It is widely used in data mining applications includ...
Jianhong Zhou, Ashfaq A. Khokhar