Sciweavers

942 search results - page 40 / 189
» Structured decomposition of adaptive applications
Sort
View
CDC
2009
IEEE
138views Control Systems» more  CDC 2009»
15 years 8 months ago
Semidefinite programming methods for system realization and identification
We describe semidefinite programming methods for system realization and identification. For each of these two applications, a variant of a simple subspace algorithm is presented, i...
Zhang Liu, Lieven Vandenberghe
COMPGEOM
2003
ACM
15 years 9 months ago
Cost-driven octree construction schemes: an experimental study
Given a scene consisting of objects, ray shooting queries answer with the first object encountered by a given ray, and are used in ray tracing and radiosity for rendering photo-r...
Boris Aronov, Hervé Brönnimann, Allen ...
ICC
2008
IEEE
126views Communications» more  ICC 2008»
15 years 10 months ago
Discovering Packet Structure through Lightweight Hierarchical Clustering
— The complexity of current Internet applications makes the understanding of network traffic a challenging task. By providing larger-scale aggregates for analysis, unsupervised ...
Abdulrahman Hijazi, Hajime Inoue, Ashraf Matrawy, ...
GPCE
2007
Springer
15 years 7 months ago
Library composition and adaptation using c++ concepts
Large scale software is composed of libraries produced by different entities. Non-intrusive and efficient mechanisms for adapting data structures from one library to conform to AP...
Jaakko Järvi, Matthew A. Marcus, Jacob N. Smi...
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 1 months ago
Fast Approximation Algorithms for Cut-based Problems in Undirected Graphs
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
Aleksander Madry