Sciweavers

166 search results - page 4 / 34
» Towards a theory of cache-efficient algorithms
Sort
View
ICCV
2003
IEEE
14 years 8 months ago
Towards a Mathematical Theory of Primal Sketch and Sketchability
In this paper, we present a mathematical theory for Marr's primal sketch. We first conduct a theoretical study of the descriptive Markov random field model and the generative...
Cheng-en Guo, Song Chun Zhu, Ying Nian Wu
ISSAC
2005
Springer
70views Mathematics» more  ISSAC 2005»
13 years 11 months ago
Approximation of dynamical systems using s-systems theory: application to biological systems
In this article we propose a new symbolic-numeric algorithm to find positive equilibria of a n-dimensional dynamical system. This algorithm uses a symbolic manipulation of ODE in...
Laurent Tournier
IUI
2003
ACM
13 years 11 months ago
Towards a theory of natural language interfaces to databases
The need for Natural Language Interfaces to databases (NLIs) has become increasingly acute as more and more people access information through their web browsers, PDAs, and cell ph...
Ana-Maria Popescu, Oren Etzioni, Henry A. Kautz
JMLR
2008
159views more  JMLR 2008»
13 years 6 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin
VISUALIZATION
2003
IEEE
13 years 11 months ago
Counting Cases in Marching Cubes: Toward a Generic Algorithm for Producing Substitopes
We describe how to count the cases that arise in a family of visualization techniques, including Marching Cubes, Sweeping Simplices, Contour Meshing, Interval Volumes, and Separat...
David C. Banks, Stephen A. Linton