976 search results - page 168 / 196 » The Complexity of Timetable Construction Problems |
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
JC
2000
13 years 8 months ago
2000
We rst review thebasic properties of the well knownclasses of Toeplitz, Hankel, Vandermonde, and other related structured matrices and reexamine their correlation to operations wi...
JMLR
2002
13 years 8 months ago
2002
When constructing a classifier, the probability of correct classification of future data points should be maximized. We consider a binary classification problem where the mean and...
WWW
2005
ACM
14 years 9 months ago
2005
ACM
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
POPL
2008
ACM
14 years 9 months ago
2008
ACM
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...