4047 search results - page 609 / 810 » The Discrete Basis Problem |
144
click to vote
ALGORITHMICA
2010
15 years 4 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...
108
click to vote
ANOR
2010
15 years 4 months ago
2010
Abstract In the controlled ovary hyperstimulation (COH) cycle of the in vitro fertilization-embryo transfer (IVFET) therapy, the clinicians observe the patients' responses to ...
157
click to vote
CGF
2010
15 years 4 months ago
2010
With ever increasing computing power, it is possible to process ever more complex fluid simulations. However, a gap between data set sizes and our ability to visualize them remain...
170
click to vote
COMGEO
2008
ACM
15 years 4 months ago
2008
ACM
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
135
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
This work considers the problem of quickest detection with N distributed sensors that receive sequential observations either in discrete or in continuous time from the environment....