Sciweavers

6740 search results - page 1150 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
ICDE
1993
IEEE
158views Database» more  ICDE 1993»
15 years 8 months ago
Data fragmentation for parallel transitive closure strategies
A topic that is currently inspiring a lot of research is parallel (distributed) computation of transitive closure queries. In [lo] the disconnection set approach has been introduc...
Maurice A. W. Houtsma, Peter M. G. Apers, Gideon L...
PODC
1989
ACM
15 years 8 months ago
Multiple Communication in Multi-Hop Radio Networks
Two tasks of communication in a multi-hop synchronous radio network are considered: point-to-point communication and broadcast (sending a message to all nodes of a network). Effi...
Reuven Bar-Yehuda, Amos Israeli
ACMICEC
2007
ACM
245views ECommerce» more  ACMICEC 2007»
15 years 8 months ago
Keyword generation for search engine advertising using semantic similarity between terms
An important problem in search engine advertising is keyword1 generation. In the past, advertisers have preferred to bid for keywords that tend to have high search volumes and hen...
Vibhanshu Abhishek, Kartik Hosanagar
CP
2007
Springer
15 years 8 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
DIS
2009
Springer
15 years 8 months ago
Discovering Influential Nodes for SIS Models in Social Networks
We address the problem of efficiently discovering the influential nodes in a social network under the susceptible/infected/susceptible (SIS) model, a diffusion model where nodes ar...
Kazumi Saito, Masahiro Kimura, Hiroshi Motoda
« Prev « First page 1150 / 1348 Last » Next »