Sciweavers

412 search results - page 38 / 83
» Ranked Join Indices
Sort
View
ICCS
2003
Springer
15 years 2 months ago
Counting Polyominoes: A Parallel Implementation for Cluster Computing
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
Iwan Jensen
CEC
2009
IEEE
15 years 2 months ago
Glomerulus extraction by using genetic algorithm for edge patching
—Glomerulus is the filtering unit of the kidney. In the computer aided diagnosis system designed for kidney disease, glomerulus extraction is an important step for analyzing kidn...
Jiaxin Ma, Jingqiao Zhang, Jinglu Hu
CEC
2010
IEEE
14 years 10 months ago
AGE-P: Moving from concept to technical realization
Even though evolutionary algorithms have been applied to a vast number of problems, they are still not always applicable. As an example, this paper briefly discusses smart applianc...
Stefan Goldmann, Ralf Salomon
CSCW
2010
ACM
15 years 6 months ago
Catchup: a useful application of time-travel in meetings
People are often required to catch up on information they have missed in meetings, because of lateness or scheduling conflicts. Catching up is a complex cognitive process where pe...
Simon Tucker, Ofer Bergman, Anand Ramamoorthy, Ste...
SIGMETRICS
2004
ACM
131views Hardware» more  SIGMETRICS 2004»
15 years 3 months ago
Failure recovery for structured P2P networks: protocol design and performance evaluation
Measurement studies indicate a high rate of node dynamics in p2p systems. In this paper, we address the question of how high a rate of node dynamics can be supported by structured...
Simon S. Lam, Huaiyu Liu