Sciweavers

2304 search results - page 381 / 461
» On the Vulnerability of Large Graphs
Sort
View
DAGM
2004
Springer
14 years 4 months ago
Learning from Labeled and Unlabeled Data Using Random Walks
We consider the general problem of learning from labeled and unlabeled data. Given a set of points, some of them are labeled, and the remaining points are unlabeled. The goal is to...
Dengyong Zhou, Bernhard Schölkopf
LPAR
2004
Springer
14 years 4 months ago
Weighted Answer Sets and Applications in Intelligence Analysis
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
ICNP
2003
IEEE
14 years 4 months ago
Distributed, Self-Stabilizing Placement of Replicated Resources in Emerging Networks
Emerging large scale distributed networking systems, such as P2P file sharing systems, sensor networks, and ad hoc wireless networks, require replication of content, functionalit...
Bong-Jun Ko, Dan Rubenstein
VTS
2003
IEEE
119views Hardware» more  VTS 2003»
14 years 4 months ago
Test Data Compression Using Dictionaries with Fixed-Length Indices
—We present a dictionary-based test data compression approach for reducing test data volume and testing time in SOCs. The proposed method is based on the use of a small number of...
Lei Li, Krishnendu Chakrabarty
FSTTCS
2003
Springer
14 years 4 months ago
On the Covering Steiner Problem
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
Anupam Gupta, Aravind Srinivasan