Sciweavers

2304 search results - page 315 / 461
» On the Vulnerability of Large Graphs
Sort
View
FCCM
2009
IEEE
171views VLSI» more  FCCM 2009»
15 years 4 months ago
Accelerating SPICE Model-Evaluation using FPGAs
—Single-FPGA spatial implementations can provide an order of magnitude speedup over sequential microprocessor implementations for data-parallel, floating-point computation in SP...
Nachiket Kapre, André DeHon
ICRA
2009
IEEE
107views Robotics» more  ICRA 2009»
15 years 4 months ago
Graph-based planning using local information for unknown outdoor environments
— One of the common applications for outdoor robots is to follow a path in large scale unknown environments. This task is challenging due to the intensive memory requirements to ...
Jinhan Lee, Roozbeh Mottaghi, Charles Pippin, Tuck...
MFCS
2009
Springer
15 years 4 months ago
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf ...
86
Voted
OTM
2009
Springer
15 years 4 months ago
LinksB2N: Automatic Data Integration for the Semantic Web
Abstract. The ongoing trend towards open data embraced by the Semantic Web has started to produce a large number of data sources. These data sources are published using RDF vocabul...
Manuel Salvadores, Gianluca Correndo, Bene Rodrigu...
PKDD
2009
Springer
124views Data Mining» more  PKDD 2009»
15 years 4 months ago
Capacity Control for Partially Ordered Feature Sets
Abstract. Partially ordered feature sets appear naturally in many classification settings with structured input instances, for example, when the data instances are graphs and a fe...
Ulrich Rückert