Sciweavers

1236 search results - page 102 / 248
» Prefix-Like Complexities and Computability in the Limit
Sort
View
CW
2004
IEEE
15 years 1 months ago
Interactive Function-Based Shape Modeling for Cyberworlds
Shared virtual worlds require exchanging shape models over the Internet. Since complex shapes such as VRML objects are often defined with polygonal meshes, the size of models may ...
Konstantin Levinski, Alexei Sourin
SPIESR
2001
164views Database» more  SPIESR 2001»
14 years 11 months ago
Content-based image retrieval using wavelet-based salient points
Content-based Image Retrieval (CBIR) has become one of the most active research areas in the past few years. Most of the attention from the research has been focused on indexing t...
Qi Tian, Nicu Sebe, Michael S. Lew, Etienne Loupia...
FSTTCS
2010
Springer
14 years 8 months ago
One-Counter Stochastic Games
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stoch...
Tomás Brázdil, Václav Brozek,...
ATAL
2010
Springer
14 years 11 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
SIGMOD
2008
ACM
169views Database» more  SIGMOD 2008»
15 years 10 months ago
MCDB: a monte carlo approach to managing uncertain data
To deal with data uncertainty, existing probabilistic database systems augment tuples with attribute-level or tuple-level probability values, which are loaded into the database al...
Ravi Jampani, Fei Xu, Mingxi Wu, Luis Leopoldo Per...