Sciweavers

1554 search results - page 96 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
IJAR
2006
98views more  IJAR 2006»
15 years 4 months ago
A forward-backward Monte Carlo method for solving influence diagrams
Although influence diagrams are powerful tools for representing and solving complex decisionmaking problems, their evaluation may require an enormous computational effort and this...
Andrés Cano, Manuel Gómez, Seraf&iac...
COMPGEOM
2008
ACM
15 years 6 months ago
Robust construction of the three-dimensional flow complex
The Delaunay triangulation and its dual the Voronoi diagram are ubiquitous geometric complexes. From a topological standpoint, the connection has recently been made between these ...
Frédéric Cazals, Aditya G. Parameswa...
ICDT
2009
ACM
147views Database» more  ICDT 2009»
16 years 5 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff
INFOCOM
2006
IEEE
15 years 11 months ago
Network Protocol System Fingerprinting - A Formal Approach
— Network protocol system fingerprinting has been recognized as an important issue and a major threat to network security. Prevalent works rely largely on human experiences and i...
Guoqiang Shu, David Lee
121
Voted
SAS
2004
Springer
105views Formal Methods» more  SAS 2004»
15 years 10 months ago
Type Inference Against Races
Abstract. The race condition checker rccjava uses a formal type system to statically identify potential race conditions in concurrent Java programs, but it requires programmer-supp...
Cormac Flanagan, Stephen N. Freund