Sciweavers

3204 search results - page 103 / 641
» The Alcuin Number of a Graph
Sort
View
INFOCOM
1993
IEEE
14 years 8 days ago
Power-Optimal Layout of Passive, Single-Hop, Fiber-Optic Interconnections Whose Capacity Increases with the Number of Stations
Passive, single-hop interconnections among N stations, each with several transmitters and receivers, provide a communication path between any two stations using one of the transmi...
Yitzhak Birk
CIKM
2008
Springer
13 years 10 months ago
Estimating the number of answers with guarantees for structured queries in p2p databases
Structured P2P overlays supporting standard database functionalities are a popular choice for building large-scale distributed data management systems. In such systems, estimating...
Marcel Karnstedt, Kai-Uwe Sattler, Michael Ha&szli...
JCT
2008
103views more  JCT 2008»
13 years 8 months ago
A bijective proof of Jackson's formula for the number of factorizations of a cycle
Factorizations of the cyclic permutation (1 2 . . . N) into two permutations with respectively n and m cycles, or, equivalently, unicellular bicolored maps with N edges and n whit...
Gilles Schaeffer, Ekaterina A. Vassilieva
ITA
2007
104views Communications» more  ITA 2007»
13 years 8 months ago
Automata, Borel functions and real numbers in Pisot base
This note is about functions f : Aω → Bω whose graph is recognized by a B¨uchi finite automaton on the product alphabet A × B. These functions are Baire class 2 in the Bair...
Benoit Cagnard, Pierre Simonnet
HICSS
2008
IEEE
90views Biometrics» more  HICSS 2008»
14 years 2 months ago
Power System Extreme Event Detection: The Vulnerability Frontier
In this work we apply graph theoretic tools to provide a close bound on a frontier relating the number of line outages in a grid to the power disrupted by the outages. This fronti...
Bernard C. Lesieutre, Ali Pinar, Sandip Roy