Sciweavers

201 search results - page 37 / 41
» A Mathematical Programming Approach to the Kernel Fisher Alg...
Sort
View
ISSAC
2004
Springer
185views Mathematics» more  ISSAC 2004»
14 years 1 months ago
Automatic generation of polynomial loop
In [17], an abstract framework for automatically generating loop invariants of imperative programs was proposed. This framework was then instantiated for the language of conjuncti...
Enric Rodríguez-Carbonell, Deepak Kapur
CN
2006
145views more  CN 2006»
13 years 7 months ago
Understanding optimal data gathering in the energy and latency domains of a wireless sensor network
The problem of optimal data gathering in wireless sensor networks (WSNs) is addressed by means of optimization techniques. The goal of this work is to lay the foundations to devel...
Ugo Monaco, Francesca Cuomo, Tommaso Melodia, Fabi...
ISCI
2008
145views more  ISCI 2008»
13 years 7 months ago
Aggregation in sensor networks with a user-provided quality of service goal
Significant research has been devoted to aggregation in sensor networks with a view to optimize its performance. Existing research has mostly concentrated on maximizing network li...
Zhen He, Byung Suk Lee, Xiaoyang Sean Wang
CLA
2007
13 years 9 months ago
An FDP-Algorithm for Drawing Lattices
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...
Christian Zschalig
EMSOFT
2004
Springer
14 years 1 months ago
Approximation of the worst-case execution time using structural analysis
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
Matteo Corti, Thomas R. Gross