Sciweavers

3991 search results - page 219 / 799
» Bounding homogeneous models
Sort
View
SODA
2001
ACM
80views Algorithms» more  SODA 2001»
13 years 9 months ago
On the discrete Bak-Sneppen model of self-organized criticality
We propose a discrete variant of the Bak-Sneppen model for self-organized criticality. In this process, a configuration is an n-bit word, and at each step one chooses a random bit...
Jérémy Barbay, Claire Kenyon
JMLR
2012
11 years 10 months ago
Minimax-Optimal Rates For Sparse Additive Models Over Kernel Classes Via Convex Programming
Sparse additive models are families of d-variate functions with the additive decomposition f∗ = ∑j∈S f∗ j , where S is an unknown subset of cardinality s d. In this paper,...
Garvesh Raskutti, Martin J. Wainwright, Bin Yu
CONCUR
2000
Springer
13 years 12 months ago
Reachability Analysis for Some Models of Infinite-State Transition Systems
We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augment...
Oscar H. Ibarra, Tevfik Bultan, Jianwen Su
CVPR
2004
IEEE
14 years 10 months ago
Hidden Semantic Concept Discovery in Region Based Image Retrieval
This paper addresses Content Based Image Retrieval (CBIR), focusing on developing a hidden semantic concept discovery methodology to address effective semanticsintensive image ret...
Ruofei Zhang, Zhongfei (Mark) Zhang
ECCV
2008
Springer
14 years 10 months ago
Passive Reflectometry
Different materials reflect light in different ways, so reflectance is a useful surface descriptor. Existing systems for measuring reflectance are cumbersome, however, and although...
Fabiano Romeiro, Yuriy Vasilyev, Todd Zickler