461 search results - page 66 / 93 » Practical polynomial factoring in polynomial time |
180
click to vote
FOCS
2008
IEEE
16 years 19 days ago
2008
IEEE
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
139
click to vote
INFOCOM
2003
IEEE
15 years 11 months ago
2003
IEEE
Abstract— We explore the problem of routing bandwidth guaranteed paths in wavelength-routed, WDM optical mesh networks. A WDM mesh network offers great flexibility in dynamicall...
209
click to vote
COMGEO
2012
ACM
14 years 1 months ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
158
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
122
click to vote
ESA
2007
Springer
16 years 10 days ago
2007
Springer
We consider a revenue maximization problem where we are selling a set of comparable items, each available in a certain quantity (possibly unlimited) to a set of bidders. Each bidde...