Sciweavers

256 search results - page 15 / 52
» Separation of NP-Completeness Notions
Sort
View
PG
2003
IEEE
15 years 2 months ago
Voxelization in Common Sampling Lattices
In this paper we introduce algorithms to voxelize polygonal meshes in common sampling lattices. In the case of Cartesian lattices, we complete the separability and minimality proo...
Haris Widjaya, Torsten Möller, Alireza Enteza...
FASE
2003
Springer
15 years 2 months ago
Model-Based Development of Web Applications Using Graphical Reaction Rules
Abstract. The OMG’s Model-Driven Architecture focusses on the evolution and integration of applications across heterogeneous middleware platforms. Presently available instances o...
Reiko Heckel, Marc Lohmann
AMAST
2008
Springer
14 years 11 months ago
Evolving Specification Engineering
Abstract. The motivation for this work is to support a natural separation of concerns during formal system development. In a developmentby-refinement context, we would like to be a...
Dusko Pavlovic, Peter Pepper, Douglas R. Smith
APWEB
2008
Springer
14 years 11 months ago
The Layered World of Scientific Conferences
Recent models have introduced the notion of dimensions and hierarchies in social networks. These models motivate the mining of small world graphs under a new perspective. We exempl...
Michael Kuhn 0002, Roger Wattenhofer
SODA
2004
ACM
131views Algorithms» more  SODA 2004»
14 years 11 months ago
When indexing equals compression: experiments with compressing suffix arrays and applications
We report on a new experimental analysis of high-order entropy-compressed suffix arrays, which retains the theoretical performance of previous work and represents an improvement in...
Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter