3991 search results - page 272 / 799 » Bounding homogeneous models |
172
click to vote
ALGORITHMICA
2010
15 years 7 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
213
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
214
Voted
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
Textures can often more easily be described as a composition of subtextures than as a single texture. The paper proposes a way to model and synthesize such "composite textures...
177
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
This paper addresses the problem of classification in situations where the data distribution is not homogeneous: Data instances might come from different locations or times, and t...
175
click to vote
ADBIS
2005
Springer
16 years 10 days ago
2005
Springer
A major application area of information systems technology and multimedia content management is that of support systems for engineering processes. This includes the particularly im...