8695 search results - page 346 / 1739 » Making the Complex Simple |
154
click to vote
DAWAK
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We present an algorithm for mining frequent queries in arbitrary relational databases, over which functional dependencies are assumed. Building upon previous results, we ...
143
click to vote
SIGMETRICS
2010
ACM
15 years 7 months ago
2010
ACM
When many flows are multiplexed on a non-saturated link, their volume changes over short timescales tend to cancel each other out, making the average change across flows close to ...
165
click to vote
AI
2008
Springer
15 years 7 months ago
2008
Springer
Classical work on eliciting and representing preferences over multi-attribute alternatives has attempted to recognize conditions under which value functions take on particularly s...
154
click to vote
CONCURRENCY
2008
15 years 7 months ago
2008
We present GAB, a search algorithm for hybrid P2P networks, that is, networks that search using both flooding and a DHT. GAB uses a gossip-style algorithm to collect global statis...
169
click to vote
ADCM
2006
15 years 6 months ago
2006
: In a recent paper by the first author, a simple proof was given of a result by Tutte on the validity of barycentric mappings, recast in terms of the injectivity of piecewise line...