Sciweavers

444 search results - page 79 / 89
» More Colourful Simplices
Sort
View
GLVLSI
2002
IEEE
108views VLSI» more  GLVLSI 2002»
14 years 10 days ago
Protected IP-core test generation
Design simplification is becoming necessary to respect the target time-to-market of SoCs, and this goal can be obtained by using predesigned IP-cores. However, their correct inte...
Alessandro Fin, Franco Fummi
ISORC
2002
IEEE
14 years 9 days ago
Reactive Objects
Object-oriented, concurrent, and event-based programming models provide a natural framework in which to express the behavior of distributed and embedded software systems. However,...
Johan Nordlander, Mark P. Jones, Magnus Carlsson, ...
ICALP
2010
Springer
14 years 5 days ago
Thresholded Covering Algorithms for Robust and Max-min Optimization
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
Anupam Gupta, Viswanath Nagarajan, R. Ravi
WDAG
2009
Springer
94views Algorithms» more  WDAG 2009»
13 years 12 months ago
Local Computation of Nearly Additive Spanners
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
Bilel Derbel, Cyril Gavoille, David Peleg, Laurent...
DAWAK
2001
Springer
13 years 12 months ago
A Theoretical Framework for Association Mining Based on the Boolean Retrieval Model
Data mining has been defined as the non- trivial extraction of implicit, previously unknown and potentially useful information from data. Association mining is one of the important...
Peter Bollmann-Sdorra, Aladdin Hafez, Vijay V. Rag...