Sciweavers

1545 search results - page 307 / 309
» On tree congestion of graphs
Sort
View
CORR
2010
Springer
141views Education» more  CORR 2010»
14 years 9 months ago
Termination Detection of Local Computations
Contrary to the sequential world, the processes involved in a distributed system do not necessarily know when a computation is globally finished. This paper investigates the proble...
Emmanuel Godard, Yves Métivier, Gerard Tel
COR
2006
97views more  COR 2006»
14 years 9 months ago
Evaluating the performance of cost-based discretization versus entropy- and error-based discretization
Discretization is defined as the process that divides continuous numeric values into intervals of discrete categorical values. In this article, the concept of cost-based discretiz...
Davy Janssens, Tom Brijs, Koen Vanhoof, Geert Wets
NAR
2008
175views more  NAR 2008»
14 years 9 months ago
Onto-CC: a web server for identifying Gene Ontology conceptual clusters
The Gene Ontology (GO) vocabulary has been extensively explored to analyze the functions of coexpressed genes. However, despite its extended use in Biology and Medical Sciences, t...
Rocío Romero-Záliz, Coral del Val, J...
JAIR
2007
132views more  JAIR 2007»
14 years 9 months ago
New Inference Rules for Max-SAT
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simpliï¬...
Chu Min Li, Felip Manyà, Jordi Planes
TMC
2008
127views more  TMC 2008»
14 years 9 months ago
Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
Nilesh Khude, Anurag Kumar, Aditya Karnik