1040 search results - page 178 / 208 » Rounding algorithms for covering problems |
KDD
2009
ACM
15 years 10 months ago
2009
ACM
In recent years, the blogosphere has experienced a substantial increase in the number of posts published daily, forcing users to cope with information overload. The task of guidin...
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...
158
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
IUI
2010
ACM
15 years 6 months ago
2010
ACM
One of the critical problems in natural language interfaces is the discordance between the expressions covered by the interface and those by the knowledge base. In the graph-based...
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
Whereas lecturing is the most widely used mode of instruction, we have explored small-group learning projects to make signal processing more appealing at the University and in Eng...