Sciweavers

3946 search results - page 341 / 790
» The computational complexity of choice sets
Sort
View
SIGECOM
2006
ACM
138views ECommerce» more  SIGECOM 2006»
16 years 24 days ago
Bid expressiveness and clearing algorithms in multiattribute double auctions
We investigate the space of two-sided multiattribute auctions, focusing on the relationship between constraints on the offers traders can express through bids, and the resulting c...
Yagil Engel, Michael P. Wellman, Kevin M. Lochner
CLADE
2003
IEEE
16 years 4 days ago
ADViCE over Grid Services: Initial Deployment
The complexity of computational grid applications and their environments has been increased due to the heterogeneity of resources; complexity, continuous changes of the applicatio...
Yoonhee Kim, Ilkyeun Ra, Sung-Yong Park, Byoung uk...
CGF
2008
75views more  CGF 2008»
15 years 7 months ago
Extraction Of Feature Lines On Surface Meshes Based On Discrete Morse Theory
We present an approach for extracting extremal feature lines of scalar indicators on surface meshes, based on discrete Morse Theory. By computing initial Morse-Smale complexes of ...
Jan Sahner, Britta Weber, Steffen Prohaska, Hans L...
CORR
2011
Springer
188views Education» more  CORR 2011»
15 years 1 months ago
Primitive words and roots of words
In the algebraic theory of codes and formal languages, the set Q of all primitive words over some alphabet Σ has received special interest. With this survey article we give an ove...
Gerhard Lischke
CVPR
2005
IEEE
16 years 8 months ago
A Bayesian Hierarchical Model for Learning Natural Scene Categories
We propose a novel approach to learn and recognize natural scene categories. Unlike previous work [9, 17], it does not require experts to annotate the training set. We represent t...
Fei-Fei Li 0002, Pietro Perona, California Institu...