Sciweavers

4781 search results - page 411 / 957
» Complexity at large
Sort
View
145
Voted
GECCO
2007
Springer
153views Optimization» more  GECCO 2007»
15 years 11 months ago
Parallel genetic algorithm: assessment of performance in multidimensional scaling
Visualization of multidimensional data by means of Multidimensional Scaling (MDS) is a popular technique of exploratory data analysis widely usable, e.g. in analysis of bio-medica...
Antanas Zilinskas, Julius Zilinskas
MODELS
2007
Springer
15 years 11 months ago
Piecewise Modelling with State Subtypes
Abstract. Models addressing both structure and behaviour of a system are usually quite complex. Much of the complexity is caused by the necessity to distinguish between different c...
Friedrich Steimann, Thomas Kühne
WDAG
2007
Springer
132views Algorithms» more  WDAG 2007»
15 years 11 months ago
Detecting Temporal Logic Predicates on Distributed Computations
Abstract. We examine the problem of detecting nested temporal predicates given the execution trace of a distributed program. We present a technique that allows efficient detection ...
Vinit A. Ogale, Vijay K. Garg
3DPVT
2006
IEEE
224views Visualization» more  3DPVT 2006»
15 years 11 months ago
3D Modeling Using Planar Segments and Mesh Elements
Range sensing technology allows the photorealistic modeling of large-scale scenes, such as urban structures. The generated 3D representations, after automated registration, are us...
Ioannis Stamos, Gene Yu, George Wolberg, Siavash Z...
FOCS
2006
IEEE
15 years 11 months ago
Higher Lower Bounds for Near-Neighbor and Further Rich Problems
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
Mihai Patrascu, Mikkel Thorup