نتایج جستجو برای: in place volume

تعداد نتایج: 17029697  

1997
Manuel Sánchez Juan López Oscar G. Plata Emilio L. Zapata

The two-dimensional discrete cosine transform (2D-DCT) is at the core of image encoding and compression applications. We present a new architecture for the 2D-DCT which is based on row-column decomposition. An efficient architecture to compute the one-dimensional fast direct (1D-DCT) and inverse cosine (1D-IDCT) transforms, which is based in reordering the butterflies after their computation, i...

Journal: :CoRR 2015
Bill Fefferman Shelby Kimmel

We study the ability of efficient quantum verifiers to decide properties of exponentially large subsets given either a classical or quantum witness. We develop a general framework that can be used to prove that QCMA machines, with only classical witnesses, cannot verify certain properties of subsets given implicitly via an oracle. We use this framework to prove an oracle separation between QCMA...

2013
Ch. G. Massouros G. G. Massouros

Fortified Transposition Hypergroups appeared during the study of the theory of Formal Languages and Automata from the point of view of the hypercompositional structures theory. This paper studies the subhypergroups of these hypergroups and presents properties of their closed, symmetric, normal and reflexive subhypergroups.

1993
Marc Daumas David W. Matula

The dot product operation is very prevalent in sci-entiic computation and has been incorporated as a primitive operation in some languages. Implementation of the dot product operation by a sequence of IEEE standard multiplications and additions does not prevent substantial error accumulation or warn about catastrophic cancellation. The design of a double precision dot product operation is prese...

Journal: :Comput. Geom. 1997
Mujtaba R. Ghouse Michael T. Goodrich

We present a number of eecient parallel algorithms for constructing 2-dimensional convex hulls on a randomized CRCW PRAM. Speciically, we show how to build the convex hull of n pre-sorted points in the plane in O(1) time using O(n log n) work, with n-exponential probability, or, alternately, in O(log n) time using O(n) work, with n-exponential probability. We also show how to nd the convex hull...

2014
Esther Iecovich

The rapid aging of many Western societies has compelled policymakers and professionals to develop concepts, programs, and services to meet the complex and diverse needs of their elderly populations, in particular the segment of older persons who are frail, chronically ill, and functionally disabled. Aging-in-place has become a key and guiding strategy in addressing and meeting the needs of olde...

2008
Reetta Sinkkilä Eetu Mäkelä Eero Hyvönen Tomi Kauppinen

Many tasks on the semantic web require the user to choose concepts from a limited vocabulary e.g. for describing an indexed resource or for use in semantic search. Semantic autocompletion interfaces offer an efficient way for concept selection. However, these interfaces usually do not expose the semantic context of the matched concepts, thereby making it hard to know if a matched concept is the...

1999
Barbara Tversky Julie Bauer Morrison Nancy Franklin David J. Bryant

All our lives, we interact with the space around us, whether we are finding our way to a remote cabana in an exotic tropical isle or reaching for a ripe mango on the tree beside the cabana or finding a comfortable position in the hammock to snack after the journey. Each of these natural situations is experienced differently, and as a consequence, each is conceptualized differently. Our knowledg...

2006
J. M. Wozniak P. Brenner D. Thain A. Striegel J. A. Izaguirre

The goal of scientific grid computing is to enable researchers to attack problems that were previously impossible. Cooperative storage systems have been assembled to provide users with access to surprisingly large amounts of useful space, but locating, accessing, and efficiently employing such distributed data sets in scientific simulation or analysis is another monumental problem. In this pape...

2007
Dariusz Kusmierek

We prove that the inhabitation problem for rank two intersection types is decidable, but (contrary to common belief) EXPTIME-hard. The exponential time hardness is shown by reduction from the in-place acceptance problem for alternating Turing machines.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید