Sciweavers

205 search results - page 32 / 41
» Theory and applications for a double-base number system
Sort
View
SPAA
2004
ACM
14 years 1 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
CIKM
2003
Springer
14 years 29 days ago
High dimensional reverse nearest neighbor queries
Reverse Nearest Neighbor (RNN) queries are of particular interest in a wide range of applications such as decision support systems, profile based marketing, data streaming, docum...
Amit Singh, Hakan Ferhatosmanoglu, Ali Saman Tosun
ADC
2003
Springer
106views Database» more  ADC 2003»
14 years 29 days ago
Database Component Ware
Database modeling is still a job of an artisan. Due to this approach database schemata evolve by growth without any evolution plan. Finally, they cannot be examined, surveyed, con...
Bernhard Thalheim
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
14 years 1 months ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie
DM
2006
128views more  DM 2006»
13 years 7 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck