Sciweavers

1736 search results - page 243 / 348
» The rank-width of Directed Graphs
Sort
View
ISW
2004
Springer
15 years 9 months ago
Using Greedy Hamiltonian Call Paths to Detect Stack Smashing Attacks
The ICAT statistics over the past few years have shown at least one out of every five CVE and CVE candidate vulnerabilities have been due to buffer overflows. This constitutes a si...
Mark Foster, Joseph N. Wilson, Shigang Chen
PAKDD
2004
ACM
96views Data Mining» more  PAKDD 2004»
15 years 9 months ago
Spectral Energy Minimization for Semi-supervised Learning
The use of unlabeled data to aid classification is important as labeled data is often available in limited quantity. Instead of utilizing training samples directly into semi-super...
Chun Hung Li, Zhi-Li Wu
SPATIALCOGNITION
2004
Springer
15 years 9 months ago
Modelling Models of Robot Navigation Using Formal Spatial Ontology
Abstract. In this paper we apply a formal ontological framework in order to deconstruct two prominent approaches to navigation from cognitive robotics, the Spatial Semantic Hierarc...
John A. Bateman, Scott Farrar
ICDCS
2003
IEEE
15 years 9 months ago
The Hash History Approach for Reconciling Mutual Inconsistency
We introduce the hash history mechanism for capturing dependencies among distributed replicas. Hash histories, consisting of a directed graph of version hashes, are independent of...
ByungHoon Kang, Robert Wilensky, John Kubiatowicz
ICCPOL
2009
Springer
15 years 9 months ago
Processing of Korean Natural Language Queries Using Local Grammars
Abstract. For casual web users, a natural language is more accessible than formal query languages. However, understanding of a natural language query is not trivial for computer sy...
Tae-Gil Noh, Yong-Jin Han, Seong-Bae Park, Se-Youn...