Sciweavers

736 search results - page 77 / 148
» Approximating the Number of Network Motifs
Sort
View
COCOON
2011
Springer
13 years 9 months ago
Finding Paths with Minimum Shared Edges
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
Masoud T. Omran, Jörg-Rüdiger Sack, Hami...
JUCS
2010
152views more  JUCS 2010»
14 years 4 months ago
Compositional Semantics of Dataflow Networks with Query-Driven Communication of Exact Values
: We develop and study the concept of dataflow process networks as used for example by Kahn to suit exact computation over data types related to real numbers, such as continuous fu...
Michal Konecný, Amin Farjudian
TSP
2012
13 years 5 months ago
Sensing and Probing Cardinalities for Active Cognitive Radios
—In a cognitive radio network, opportunistic spectrum access (OSA) to the underutilized spectrum involves not only sensing the spectrum occupancy but also probing the channel qua...
Thang Van Nguyen, Hyundong Shin, Tony Q. S. Quek, ...
ISCC
2007
IEEE
15 years 4 months ago
Long Horizon End-to-End Delay Forecasts: A Multi-Step-Ahead Hybrid Approach
A long horizon end-to-end delay forecast, if possible, will be a breakthrough in traffic engineering. This paper introduces a hybrid approach to forecast end-to-end delays using ...
Vinh Bui, Weiping Zhu, Antonio Pescapè, Ale...
ECIR
2004
Springer
14 years 11 months ago
Performance Analysis of Distributed Architectures to Index One Terabyte of Text
We simulate different architectures of a distributed Information Retrieval system on a very large Web collection, in order to work out the optimal setting for a particular set of r...
Fidel Cacheda, Vassilis Plachouras, Iadh Ounis