Sciweavers

1538 search results - page 232 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
15 years 8 months ago
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
Sandeep Sen, V. N. Muralidhara
IUI
2009
ACM
15 years 10 months ago
Structuring and manipulating hand-drawn concept maps
Concept maps are an important tool to knowledge organization, representation, and sharing. Most current concept map tools do not provide full support for hand-drawn concept map cr...
Yingying Jiang, Feng Tian, XuGang Wang, Xiaolong Z...
ATVA
2004
Springer
138views Hardware» more  ATVA 2004»
15 years 5 months ago
Providing Automated Verification in HOL Using MDGs
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...
Tarek Mhamdi, Sofiène Tahar
ICDE
2012
IEEE
196views Database» more  ICDE 2012»
13 years 3 months ago
Scalable Multi-query Optimization for SPARQL
Abstract—This paper revisits the classical problem of multiquery optimization in the context of RDF/SPARQL. We show that the techniques developed for relational and semi-structur...
Wangchao Le, Anastasios Kementsietsidis, Songyun D...
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
16 years 2 months ago
Finding, minimizing, and counting weighted subgraphs
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
Virginia Vassilevska, Ryan Williams