197 search results - page 6 / 40 » On the Existence of Large Sets of t-designs of Prime Sizes |
TPDS
2010
13 years 5 months ago
2010
This paper studies the problem of realizing a common software clock among a large set of nodes without an external time reference (i.e., internal clock synchronization), any centr...
DASFAA
2004
IEEE
13 years 11 months ago
2004
IEEE
The update transactions to be executed in spatial databases have been usually known as interactive and long duration works. When a spatial object has a very large geometry of which...
DAWAK
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Many real world applications rely on the discovery of maximal biclique subgraphs (complete bipartite subgraphs). However, existing algorithms for enumerating maximal bicl...
ICPADS
2006
IEEE
14 years 1 months ago
2006
IEEE
When computationally feasible, mining extremely large databases produces tremendously large numbers of frequent patterns. In many cases, it is impractical to mine those datasets d...
APWEB
2010
Springer
13 years 10 months ago
2010
Springer
The skyline of a set P of multi-dimensional points (tuples) consists of those points in P for which no clearly better point in P exists, using component-wise comparison on domains ...