In graphs of bounded arboricity, the total complexity of all maximal complete bipartite subgraphs is O(n). We describe a linear time algorithm to list such subgraphs. The arboricity bound is necessary: for any constant k and any n there exists an n-vertex graph with O(n) edges and (n/ log n) maximal complete bipartite subgraphs Kk,`. ∗Work supported in part by NSF grant CCR-9258355.

Maril, Nimrod, Hadassa Degani, Edna Rushkin, A. Dean Sherry, and Mildred Cohn. Kinetics of cyclocreatine and Na1 cotransport in human breast cancer cells: mechanism of activity. Am. J. Physiol. 277 (Cell Physiol. 46): C708–C716, 1999.—The growth-inhibitory effect of cyclocreatine (CCr) and the kinetics of CCr and Na1 cotransport were investigated in MCF7 human breast cancer cells and its adriam...

Cross-document co-reference resolution (CCR) computes equivalence classes over textual mentions denoting the same entity in a document corpus. Named-entity linking (NEL) disambiguates mentions onto entities present in a knowledge base (KB) or maps them to null if not present in the KB. Traditionally, CCR and NEL have been addressed separately. However, such approaches miss out on the mutual syn...

Although most patients with chronic myeloid leukemia (CML) treated with imatinib mesylate achieve a complete cytogenetic response (CCR), some patients will relapse. To determine the potential of real-time quantitative BCR-ABL reverse transcriptase-polymerase chain reaction (RT-PCR) to predict the duration of continued CCR, we monitored 85 patients treated with imatinib mesylate who achieved a C...

Resource allocation and admission control are critical tasks in a communication network that often must be performed online. Algorithms for these types of problems have been considered both under benefit models (e.g., with a goal of approximately maximizing the number of requests accepted) and under cost models (e.g., with a goal of approximately minimizing the number of requests rejected). Unf...

We consider the complexity of properly learning concept classes, i.e. when the learner must output a hypothesis of the same form as the unknown concept. We present the following new upper and lower bounds on well-known concept classes: • We show that unless NP = RP, there is no polynomial-time PAC learning algorithm for DNF formulas where the hypothesis is an OR-of-thresholds. Note that as spec...

Objective: To investigate the effects of a 12 week comprehensive cardiac rehabilitation (CCR) programme on patients who have undergone implantation of an implantable cardioverter-defibrillator (ICD). Design: Sixteen patients with ICDs (14 (88%) male, mean (SD) age 58 (10) years, range 34–74 years) were randomised to either attend an individually tailored CCR programme or receive usual care. The...

Introducción: Las enfermedades crónicas, y en particular el cáncer colorrectal (CCR), devienen una experiencia de vida crítica, pues la enfermedad invade desarticula las esferas cotidianidad identidad tanto persona como familia quien lo sufre. Objetivos: Comprender los significados vivida por personas con diagnóstico CCR su cotidiana relación atención salud recibida. Metodología: Se realizó un ...

A new staging system for multiple myeloma (MM) has utilized serum concentrations of beta2-microglobulin (Sbeta2M) and albumin as important prognostic factors for survival. Since Sbeta2M is an indicator of glomerular filtration rate, we compared the prognostic values of Sbeta2M and 24-hr urinary creatinine clearance (Ccr) in patients with MM. We retrospectively reviewed the records of 170 MM pat...