Sciweavers

3204 search results - page 555 / 641
» The Alcuin Number of a Graph
Sort
View
INFOCOM
2007
IEEE
16 years 20 days ago
Acyclic Type of Relationships Between Autonomous Systems
Abstract— The Internet connectivity in the Autonomous System (AS) level reflects the commercial relationship between ASes. A connection between two ASes could be of type custome...
Rami Cohen, Danny Raz
IPPS
2007
IEEE
16 years 20 days ago
Optimal Assignment of a Tree-Structured Context Reasoning Procedure onto a Host-Satellites System
In this paper, we study the problem of an optimal assignment of a tree-structured context reasoning procedure onto the computation resources in a hostsatellites configuration. The...
Hailiang Mei, Pravin Pawar, Ing Widya
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
16 years 16 days ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey
CRYPTO
2007
Springer
134views Cryptology» more  CRYPTO 2007»
16 years 16 days ago
Domain Extension of Public Random Functions: Beyond the Birthday Barrier
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}â...
Ueli M. Maurer, Stefano Tessaro
ESA
2007
Springer
115views Algorithms» more  ESA 2007»
16 years 16 days ago
Approximation of Partial Capacitated Vertex Cover
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
Reuven Bar-Yehuda, Guy Flysher, Julián Mest...