Sciweavers

1983 search results - page 306 / 397
» Competitive graph searches
Sort
View
NETWORKS
2007
13 years 7 months ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu
INTERNET
2010
283views more  INTERNET 2010»
13 years 6 months ago
Querying the Data Web: The MashQL Approach
 We propose a query formulation language, called MashQL for querying and mashing up structured data on the web. The novelty of  MashQL is that it does not require...
Mustafa Jarrar, Marios D. Dikaiakos
SADM
2010
123views more  SADM 2010»
13 years 6 months ago
Discriminative frequent subgraph mining with optimality guarantees
The goal of frequent subgraph mining is to detect subgraphs that frequently occur in a dataset of graphs. In classification settings, one is often interested in discovering discr...
Marisa Thoma, Hong Cheng, Arthur Gretton, Jiawei H...
WINET
2010
128views more  WINET 2010»
13 years 6 months ago
Distributed algorithms for lifetime maximization in sensor networks via Min-Max spanning subgraphs
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...
Harri Haanpää, André Schumacher, ...
ACL
2009
13 years 5 months ago
A Graph-based Semi-Supervised Learning for Question-Answering
We present a graph-based semi-supervised learning for the question-answering (QA) task for ranking candidate sentences. Using textual entailment analysis, we obtain entailment sco...
Asli Çelikyilmaz, Marcus Thint, Zhiheng Hua...