2127 search results - page 359 / 426 » Computing large matchings fast |
154
Voted
ICCAD
2007
IEEE
16 years 17 days ago
2007
IEEE
Functional dependency is concerned with rewriting a Boolean function f as a function h over a set of base functions {g1, …, gn}, i.e. f = h(g1, …, gn). It plays an important r...
102
Voted
ICDM
2009
IEEE
15 years 10 months ago
2009
IEEE
Distribution data naturally arise in countless domains, such as meteorology, biology, geology, industry and economics. However, relatively little attention has been paid to data m...
130
Voted
ICC
2008
IEEE
15 years 10 months ago
2008
IEEE
— In large Wireless Sensor Networks (WSNs), each hop might incur varying delays due to medium access contention, transmission and computation delays. Fast and efficient query re...
134
Voted
CHES
2005
Springer
2005
Springer
Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization
15 years 9 months ago
Motivated by the goal of factoring large integers using the Number Field Sieve, several special-purpose hardware designs have been recently proposed for solving large sparse system...
145
Voted
SIGCOMM
2004
ACM
15 years 9 months ago
2004
ACM
All Internet routers contain buffers to hold packets during times of congestion. Today, the size of the buffers is determined by the dynamics of TCP’s congestion control algor...