Sciweavers

135 search results - page 12 / 27
» Basis partitions and Rogers-Ramanujan partitions
Sort
View
WAW
2004
Springer
178views Algorithms» more  WAW 2004»
14 years 21 days ago
Communities Detection in Large Networks
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
Andrea Capocci, Vito Domenico Pietro Servedio, Gui...
SODA
2012
ACM
235views Algorithms» more  SODA 2012»
11 years 9 months ago
Fast zeta transforms for lattices with few irreducibles
We investigate fast algorithms for changing between the standard basis and an orthogonal basis of idempotents for M¨obius algebras of finite lattices. We show that every lattice...
Andreas Björklund, Mikko Koivisto, Thore Husf...
ICDT
1997
ACM
133views Database» more  ICDT 1997»
13 years 11 months ago
A Formal Foundation for Distributed Workflow Execution Based on State Charts
This paper provides a formal foundation for distributed workfiow executions. The state chart formalism is adapted to the needs of a workflow model in order to establish a basis for...
Dirk Wodtke, Gerhard Weikum
COMBINATORICS
2000
81views more  COMBINATORICS 2000»
13 years 7 months ago
Interchangeability of Relevant Cycles in Graphs
The set R of relevant cycles of a graph G is the union of its minimum cycle bases. We introduce a partition of R such that each cycle in a class W can be expressed as a sum of oth...
Petra M. Gleiss, Josef Leydold, Peter F. Stadler
CHES
2009
Springer
150views Cryptology» more  CHES 2009»
14 years 2 months ago
A Design Flow and Evaluation Framework for DPA-Resistant Instruction Set Extensions
Power-based side channel attacks are a significant security risk, especially for embedded applications. To improve the security of such devices, protected logic styles have been p...
Francesco Regazzoni, Alessandro Cevrero, Fran&cced...