Sciweavers

2738 search results - page 146 / 548
» The Frobenius Problem and Its Generalizations
Sort
View
INFOCOM
2011
IEEE
14 years 8 months ago
Scheduling for small delay in multi-rate multi-channel wireless networks
—This paper considers the problem of designing scheduling algorithms for multi-channel (e.g., OFDM-based) wireless downlink systems. We show that the Server-Side Greedy (SSG) rul...
Shreeshankar Bodas, Sanjay Shakkottai, Lei Ying, R...
ICCV
2011
IEEE
14 years 4 months ago
Learning to Cluster Using High Order Graphical Models with Latent Variables
This paper proposes a very general max-margin learning framework for distance-based clustering. To this end, it formulates clustering as a high order energy minimization problem w...
Nikos Komodakis
COSIT
2011
Springer
322views GIS» more  COSIT 2011»
14 years 4 months ago
CLP(QS): A Declarative Spatial Reasoning Framework
Abstract. We propose CLP(QS), a declarative spatial reasoning framework capable of representing and reasoning about high-level, qualitative spatial knowledge about the world. We sy...
Mehul Bhatt, Jae Hee Lee, Carl Schultz
KDD
2008
ACM
166views Data Mining» more  KDD 2008»
16 years 4 months ago
Generating succinct titles for web URLs
How can a search engine automatically provide the best and most appropriate title for a result URL (link-title) so that users will be persuaded to click on the URL? We consider th...
Deepayan Chakrabarti, Ravi Kumar, Kunal Punera
STOC
2003
ACM
95views Algorithms» more  STOC 2003»
16 years 4 months ago
Random knapsack in expected polynomial time
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
René Beier, Berthold Vöcking