Sciweavers

3368 search results - page 463 / 674
» Computational Grids
Sort
View
PERCOM
2005
ACM
16 years 6 months ago
Energy Efficient Differentiable Coverage Service Protocols for Wireless Sensor Networks
This paper considers the problem of maintaining the coverage degree of a wireless sensor network at an application specific level while keeping the sensing units of only a subset o...
Hasan Çam, Hidayet Ozgur Sanli
GD
2007
Springer
16 years 23 days ago
A Bipartite Strengthening of the Crossing Lemma
Let G = (V, E) be a graph with n vertices and m ≥ 4n edges drawn in the plane. The celebrated Crossing Lemma states that G has at least Ω(m3 /n2 ) pairs of crossing edges; or ...
Jacob Fox, János Pach, Csaba D. Tóth
GRID
2005
Springer
16 years 4 days ago
An end-to-end Web services-based infrastructure for biomedical applications
— Services-oriented architectures hold a lot of promise for grid-enabling scientific applications. In recent times, Web services have gained wide-spread acceptance in the Grid c...
Sriram Krishnan, Kim Baldridge, Jerry P. Greenberg...
GECCO
2007
Springer
197views Optimization» more  GECCO 2007»
16 years 23 days ago
Computational intelligence techniques: a study of scleroderma skin disease
This paper presents an analysis of microarray gene expression data from patients with and without scleroderma skin disease using computational intelligence and visual data mining ...
Julio J. Valdés, Alan J. Barton
GD
1997
Springer
15 years 10 months ago
Area Requirements for Drawing Hierarchically Planar Graphs
d Abstract) In this paper, we investigate area requirements for drawing s-t hierarchically planar graphs by straight-lines. Two drawing standards will be discussed: 1) each vertex ...
Xuemin Lin, Peter Eades