Sciweavers

153 search results - page 26 / 31
» On an equivalence in discrete extremal problems
Sort
View
WWW
2009
ACM
14 years 7 months ago
Query clustering using click-through graph
In this paper we describe a problem of discovering query clusters from a click-through graph of web search logs. The graph consists of a set of web search queries, a set of pages ...
Jeonghee Yi, Farzin Maghoul
IPPS
2006
IEEE
14 years 24 days ago
Selecting the tile shape to reduce the total communication volume
In this paper we revisit the tile-shape selection problem, that has been extensively discussed in bibliography. An efficient approach is proposed for the selection of a suitable t...
Nikolaos Drosinos, Georgios I. Goumas, Nectarios K...
MOC
1998
108views more  MOC 1998»
13 years 6 months ago
Numerical conformal mapping based on the generalised conjugation operator
Abstract. An iterative procedure for numerical conformal mapping is presented which imposes no restriction on the boundary complexity. The formulation involves two analytically equ...
Bao Cheng Li, Stavros Syngellakis
DM
2006
128views more  DM 2006»
13 years 6 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
MCU
2004
126views Hardware» more  MCU 2004»
13 years 8 months ago
Universality and Cellular Automata
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...
Klaus Sutner