Sciweavers

1132 search results - page 207 / 227
» Structural Average Case Complexity
Sort
View
COMPGEOM
2009
ACM
14 years 2 months ago
Near-linear approximation algorithms for geometric hitting sets
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
Pankaj K. Agarwal, Esther Ezra, Micha Sharir
FC
2007
Springer
125views Cryptology» more  FC 2007»
14 years 1 months ago
Scalable Authenticated Tree Based Group Key Exchange for Ad-Hoc Groups
Task-specific groups are often formed in an ad-hoc manner within big structures, like companies. Take the following typical scenario: A high rank manager decides that a task force...
Yvo Desmedt, Tanja Lange, Mike Burmester
SCESM
2006
ACM
238views Algorithms» more  SCESM 2006»
14 years 1 months ago
Nobody's perfect: interactive synthesis from parametrized real-time scenarios
As technical systems keep growing more complex and sophisticated, designing software for the safety-critical coordination between their components becomes increasingly difficult....
Holger Giese, Stefan Henkler, Martin Hirsch, Flori...
ECOOP
1999
Springer
13 years 12 months ago
Visualizing Reference Patterns for Solving Memory Leaks in Java
Many Java programmers believe they do not have to worry about memory management because of automatic garbage collection. In fact, many Java programs run out of memory unexpectedly ...
Wim De Pauw, Gary Sevitsky
JISBD
2001
13 years 9 months ago
Conceptual Modeling of Device-Independent Web Applications
Existing tools intended to build and deploy engaging complex Web sites (including functionality) have shown to be inadequate to face the software production process in an unified a...
Jaime Gómez, Cristina Cachero