Sciweavers

1458 search results - page 105 / 292
» Monads for incremental computing
Sort
View
WADS
2009
Springer
267views Algorithms» more  WADS 2009»
15 years 7 months ago
Computing the Implicit Voronoi Diagram in Triple Precision
In a paper that considered arithmetic precision as a limited resource in the design and analysis of algorithms, Liotta, Preparata and Tamassia defined an “implicit Voronoi diagr...
David L. Millman, Jack Snoeyink
ICDT
2001
ACM
110views Database» more  ICDT 2001»
15 years 7 months ago
On Answering Queries in the Presence of Limited Access Patterns
In information-integration systems, source relations often have limitations on access patterns to their data; i.e., when one must provide values for certain attributes of a relatio...
Chen Li, Edward Y. Chang
CVPR
2011
IEEE
14 years 10 months ago
Discrete-Continuous Optimization for Large-scale Structure from Motion
Recent work in structure from motion (SfM) has successfully built 3D models from large unstructured collections of images downloaded from the Internet. Most approaches use increme...
David Crandall, Andrew Owens, Noah Snavely, Daniel...
155
Voted
ICPADS
2010
IEEE
15 years 1 months ago
Enhancing MapReduce via Asynchronous Data Processing
The MapReduce programming model simplifies large-scale data processing on commodity clusters by having users specify a map function that processes input key/value pairs to generate...
Marwa Elteir, Heshan Lin, Wu-chun Feng
ASP
2005
Springer
15 years 8 months ago
An Interactive Approach to Answer Set Programming
This paper outlines a novel approach to the computation of answer sets in an evolving and interactive environment. Instead of recomputing the semantics of the entire program, our a...
Martin Brain, Richard Watson, Marina De Vos