2127 search results - page 109 / 426 » Computing large matchings fast |
129
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Network querying aims to search a large network for subnetwork regions that are similar to a given query network. In this paper, we propose a novel algorithm for querying large sc...
165
click to vote
AAECC
2003
Springer
15 years 7 months ago
2003
Springer
Elliptic curve cryptosystems are usually implemented over fields of characteristic two or over (large) prime fields. For large prime fields, projective coordinates are more suitabl...
157
click to vote
JMLR
2010
14 years 10 months ago
2010
Current methods for causal structure learning tend to be computationally intensive or intractable for large datasets. Some recent approaches have speeded up the process by first m...
153
click to vote
ANCS
2011
ACM
14 years 3 months ago
2011
ACM
Peer-to-peer (P2P) applications distribute large files fast. That makes them popular on the Internet and has motivated their use on datacenter networks. On datacenter networks, h...
135
click to vote
EXPCS
2007
15 years 7 months ago
2007
In this paper, we introduce EXACT, the EXperimental Algorithmics Computational Toolkit. EXACT is a software framework for describing, controlling, and analyzing computer experimen...