Sciweavers

113 search results - page 8 / 23
» Determining the Significance of Item Order In Randomized Pro...
Sort
View
IJCAI
2001
13 years 9 months ago
CABOB: A Fast Optimal Algorithm for Combinatorial Auctions
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
Tuomas Sandholm, Subhash Suri, Andrew Gilpin, Davi...
CVPR
2009
IEEE
15 years 3 months ago
Global Connectivity Potentials for Random Field Models
Markov random field (MRF, CRF) models are popular in computer vision. However, in order to be computationally tractable they are limited to incorporate only local interactions a...
Sebastian Nowozin, Christoph H. Lampert
DAC
2006
ACM
14 years 8 months ago
Scheduling-based test-case generation for verification of multimedia SoCs
Multimedia SoCs are characterized by a main controller that directs the activity of several cores, each of which is in charge of a stage in the processing of a media stream. The v...
Amir Nahir, Avi Ziv, Roy Emek, Tal Keidar, Nir Ron...
ACL
2009
13 years 5 months ago
Case markers and Morphology: Addressing the crux of the fluency problem in English-Hindi SMT
We report in this paper our work on accurately generating case markers and suffixes in English-to-Hindi SMT. Hindi is a relatively free word-order language, and makes use of a com...
Ananthakrishnan Ramanathan, Hansraj Choudhary, Avi...
KDD
2006
ACM
147views Data Mining» more  KDD 2006»
14 years 8 months ago
Summarizing itemset patterns using probabilistic models
In this paper, we propose a novel probabilistic approach to summarize frequent itemset patterns. Such techniques are useful for summarization, post-processing, and end-user interp...
Chao Wang, Srinivasan Parthasarathy