Sciweavers

828 search results - page 143 / 166
» Simplicial Powers of Graphs
Sort
View
PPL
2000
110views more  PPL 2000»
13 years 7 months ago
Faulty Random Geometric Networks
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
Josep Díaz, Jordi Petit, Maria J. Serna
TCAD
2002
121views more  TCAD 2002»
13 years 7 months ago
Robust Boolean reasoning for equivalence checking and functional property verification
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuits...
Andreas Kuehlmann, Viresh Paruthi, Florian Krohm, ...
PVLDB
2008
121views more  PVLDB 2008»
13 years 7 months ago
Type inference and type checking for queries on execution traces
This paper studies, for the first time, the management of type information for an important class of semi-structured data: nested DAGs (Directed Acyclic Graphs) that describe exec...
Daniel Deutch, Tova Milo
VIROLOGY
2010
162views more  VIROLOGY 2010»
13 years 5 months ago
Applied parallel coordinates for logs and network traffic attack analysis
By looking on how computer security issues are handled today, dealing with numerous and unknown events is not easy. Events need to be normalized, abnormal behaviors must be describ...
Sébastien Tricaud, Philippe Saadé
EMNLP
2010
13 years 5 months ago
A Semi-Supervised Method to Learn and Construct Taxonomies Using the Web
Although many algorithms have been developed to harvest lexical resources, few organize the mined terms into taxonomies. We propose (1) a semi-supervised algorithm that uses a roo...
Zornitsa Kozareva, Eduard H. Hovy