Sciweavers

2957 search results - page 159 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
IPPS
2006
IEEE
16 years 2 days ago
Using virtual grids to simplify application scheduling
Users and developers of grid applications have access to increasing numbers of resources. While more resources generally mean higher capabilities for an application, they also rai...
Richard Y. Huang, Henri Casanova, Andrew A. Chien
ICDM
2005
IEEE
142views Data Mining» more  ICDM 2005»
15 years 11 months ago
Shortest-Path Kernels on Graphs
Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available b...
Karsten M. Borgwardt, Hans-Peter Kriegel
EPIA
2005
Springer
15 years 11 months ago
Reducing Propositional Theories in Equilibrium Logic to Logic Programs
The paper studies reductions of propositional theories in equilibrium logic to logic programs under answer set semantics. Specifically we are concerned with the question of how to...
Pedro Cabalar, David Pearce, Agustín Valver...
GD
2005
Springer
15 years 11 months ago
C-Planarity of Extrovert Clustered Graphs
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...
Michael T. Goodrich, George S. Lueker, Jonathan Z....
IPSN
2005
Springer
15 years 11 months ago
Maximizing system lifetime in wireless sensor networks
Maximizing system lifetime in battery-powered wireless sensor networks with power aware topology control protocols and routing protocols has received intensive research. In the pa...
Qunfeng Dong