Sciweavers

1814 search results - page 320 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
ANOR
2005
160views more  ANOR 2005»
13 years 9 months ago
Packing r-Cliques in Weighted Chordal Graphs
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
Pavol Hell, Sulamita Klein, Loana Tito Nogueira, F...
INFOCOM
2007
IEEE
14 years 3 months ago
Reliable Broadcast in Wireless Networks with Probabilistic Failures
We consider the problem of reliable broadcast in a wireless network in which nodes are prone to failure. In the failure mode considered in this paper, each node can fail independe...
Vartika Bhandari, Nitin H. Vaidya
DNA
2007
Springer
176views Bioinformatics» more  DNA 2007»
14 years 3 months ago
Asynchronous Spiking Neural P Systems: Decidability and Undecidability
In search for “realistic” bio-inspired computing models, we consider asynchronous spiking neural P systems, in the hope to get a class of computing devices with decidable prope...
Matteo Cavaliere, Ömer Egecioglu, Oscar H. Ib...
IQIS
2005
ACM
14 years 2 months ago
Exploiting relationships for object consolidation
Researchers in the data mining area frequently have to spend significant portion of their time on preprocessing the data in order to apply their algorithms to real-world datasets...
Zhaoqi Chen, Dmitri V. Kalashnikov, Sharad Mehrotr...
BMCBI
2010
98views more  BMCBI 2010»
13 years 9 months ago
Resolving anaphoras for the extraction of drug-drug interactions in pharmacological documents
Background: Drug-drug interactions are frequently reported in the increasing amount of biomedical literature. Information Extraction (IE) techniques have been devised as a useful ...
Isabel Segura-Bedmar, Mario Crespo, César d...