Sciweavers

1730 search results - page 188 / 346
» Algebra and Computation
Sort
View
SIGMOD
2009
ACM
220views Database» more  SIGMOD 2009»
16 years 6 months ago
Keyword search in databases: the power of RDBMS
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...
Lu Qin, Jeffrey Xu Yu, Lijun Chang
FSS
2006
140views more  FSS 2006»
15 years 6 months ago
Advances and challenges in interval-valued fuzzy logic
Among the various extensions to the common [0, 1]-valued truth degrees of "traditional" fuzzy set theory, closed intervals of [0, 1] stand out as a particularly appealin...
Chris Cornelis, Glad Deschrijver, Etienne E. Kerre
ASPLOS
2009
ACM
16 years 7 months ago
QR decomposition on GPUs
QR decomposition is a computationally intensive linear algebra operation that factors a matrix A into the product of a unitary matrix Q and upper triangular matrix R. Adaptive sys...
Andrew Kerr, Dan Campbell, Mark Richards
CPHYSICS
2006
85views more  CPHYSICS 2006»
15 years 6 months ago
Simulation of n-qubit quantum systems. II. Separability and entanglement
Studies on the entanglement of n-qubit quantum systems have attracted a lot of interest during recent years. Despite the central role of entanglement in quantum information theory...
T. Radtke, S. Fritzsche
SWAT
2004
Springer
108views Algorithms» more  SWAT 2004»
15 years 11 months ago
Pointed Binary Encompassing Trees
For n disjoint line segments in the plane we can construct a binary encompassing tree such that every vertex is pointed, what’s more, at every segment endpoint all incident edges...
Michael Hoffmann, Bettina Speckmann, Csaba D. T&oa...