Sciweavers

11051 search results - page 243 / 2211
» An Investigation of Generalized Cases
Sort
View
ATAL
2010
Springer
15 years 7 months ago
Parameterizing the winner determination problem for combinatorial auctions
Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...
David Loker, Kate Larson
DM
2008
77views more  DM 2008»
15 years 5 months ago
Perfect Skolem sets
A Skolem sequence is a sequence s1, s2, . . . , s2n (where si A = {1 . . . n}), each si occurs exactly twice in the sequence and the two occurrences are exactly si positions apar...
Gustav Nordh
COLING
2010
15 years 1 months ago
Exploring the Data-Driven Prediction of Prepositions in English
Prepositions in English are a well-known challenge for language learners, and the computational analysis of preposition usage has attracted significant attention. Such research ge...
Anas Elghafari, Detmar Meurers, Holger Wunsch
COMPGEOM
2011
ACM
14 years 10 months ago
Compressive sensing with local geometric features
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...
Rishi Gupta, Piotr Indyk, Eric Price, Yaron Rachli...
JCAM
2011
78views more  JCAM 2011»
14 years 9 months ago
Symmetric box-splines on root lattices
Root lattices are efficient sampling lattices for reconstructing isotropic signals in arbitrary dimensions, due to their highly symmetric structure. One root lattice, the Cartesia...
Minho Kim, Jörg Peters