1279 search results - page 234 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
110
click to vote
DAC
2006
ACM
16 years 2 months ago
2006
ACM
We address the problem of estimating controller delay from high-level specifications during behavioral synthesis. Typically, the critical path of a synthesised behavioral design g...
103
click to vote
WWW
2008
ACM
16 years 2 months ago
2008
ACM
Web graphs are approximate snapshots of the web, created by search engines. Their creation is an error-prone procedure that relies on the availability of Internet nodes and the fa...
112
click to vote
WWW
2010
ACM
15 years 8 months ago
2010
ACM
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
SIGIR
2009
ACM
15 years 8 months ago
2009
ACM
Type-ahead search is a new information-access paradigm, in which systems can find answers to keyword queries “onthe-fly” as a user types in a query. It improves traditional ...
SPAA
2003
ACM
15 years 6 months ago
2003
ACM
We consider the practical problem of task assignment in a server farm, where each arriving job is immediately dispatched to a server in the farm. We look at the benefit of cycle ...