Sciweavers

3608 search results - page 549 / 722
» computing 2011
Sort
View
160
Voted
PR
2011
14 years 10 months ago
A sum-over-paths extension of edit distances accounting for all sequence alignments
This paper introduces a simple Sum-over-Paths (SoP) formulation of string edit distances accounting for all possible alignments between two sequences, and extends related previous...
Silvia García-Díez, François ...
152
Voted
TCS
2011
14 years 10 months ago
Communication complexity and intrinsic universality in cellular automata
Let F be a cellular automaton (CA). This paper establishes necessary conditions for F in order to be intrinsically universal. The central idea is to consider the communication com...
Eric Goles Chacc, Pierre-Etienne Meunier, Ivan Rap...
167
Voted
COMPGEOM
2011
ACM
14 years 7 months ago
Reeb graphs: approximation and persistence
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
Tamal K. Dey, Yusu Wang
171
Voted
ANCS
2011
ACM
14 years 3 months ago
A Scalability Study of Enterprise Network Architectures
The largest enterprise networks already contain hundreds of thousands of hosts. Enterprise networks are composed of Ethernet subnets interconnected by IP routers. These routers re...
Brent Stephens, Alan L. Cox, Scott Rixner, T. S. E...
212
Voted
ISCA
2011
IEEE
486views Hardware» more  ISCA 2011»
14 years 7 months ago
Dark silicon and the end of multicore scaling
Since 2005, processor designers have increased core counts to exploit Moore’s Law scaling, rather than focusing on single-core performance. The failure of Dennard scaling, to wh...
Hadi Esmaeilzadeh, Emily R. Blem, Renée St....