Sciweavers

757 search results - page 88 / 152
» How to decide
Sort
View
CPAIOR
2011
Springer
13 years 18 days ago
Almost Square Packing
Abstract. The almost square rectangle packing problem involves packing all rectangles with sizes 1 × 2 to n × (n + 1) (almost squares) into an enclosing rectangle of minimal area...
Helmut Simonis, Barry O'Sullivan
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
14 years 3 months ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
Dan Olteanu, Jiewen Huang, Christoph Koch
TAPSOFT
1997
Springer
14 years 1 months ago
Set Operations for Recurrent Term Schematizations
Abstract. Reasoning on programs and automated deduction often require the manipulation of in nite sets of objects. Many formalisms have been proposed to handle such sets. Here we d...
Ali Amaniss, Miki Hermann, Denis Lugiez
SIGGRAPH
1987
ACM
14 years 17 days ago
Generating antialiased images at low sampling densities
Ray tracing produces point samples of an image from a 3-D model. Constructing an antialiased digital picture from point samples is difficult without resorting to extremely high sa...
Don P. Mitchell
CL
2010
Springer
13 years 9 months ago
Cost-driven autonomous mobility
Autonomous mobile programs (AMPs) offer a novel decentralised load management technology where periodic use is made of cost models to decide where to execute in a network. In this...
Xiao Yan Deng, Greg Michaelson, Philip W. Trinder