Sciweavers

1389 search results - page 273 / 278
» Lightweight dependent classes
Sort
View
CORR
2002
Springer
166views Education» more  CORR 2002»
13 years 7 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck
ECOI
2007
101views more  ECOI 2007»
13 years 7 months ago
Reasoning about taxonomies in first-order logic
Experts often disagree about the organization of biological taxa. The shifting definitions of taxonomic names complicate otherwise simple queries concerning these taxa. For examp...
David Thau, Bertram Ludäscher
JMIV
2000
141views more  JMIV 2000»
13 years 7 months ago
Critical Motions for Auto-Calibration When Some Intrinsic Parameters Can Vary
Auto-calibration is the recovery of the full camera geometry and Euclidean scene structure from several images of an unknown 3D scene, using rigidity constraints and partial knowl...
Fredrik Kahl, Bill Triggs, Kalle Åström
CONCURRENCY
1998
87views more  CONCURRENCY 1998»
13 years 7 months ago
Titanium: A High-performance Java Dialect
Titanium is a language and system for high-performance parallel scientific computing. Titanium uses Java as its base, thereby leveraging the advantages of that language and allow...
Katherine A. Yelick, Luigi Semenzato, Geoff Pike, ...
COMBINATORICS
1999
64views more  COMBINATORICS 1999»
13 years 7 months ago
Orthogonal Colorings of Graphs
An orthogonal coloring of a graph G is a pair {c1, c2} of proper colorings of G, having the property that if two vertices are colored with the same color in c1, then they must hav...
Yair Caro, Raphael Yuster