Sciweavers

1963 search results - page 187 / 393
» The Maximum Solution Problem on Graphs
Sort
View
MOC
2010
14 years 10 months ago
Convergent finite element discretization of the multi-fluid nonstationary incompressible magnetohydrodynamics equations
Abstract. We propose a convergent implicit stabilized finite element discretization of the nonstationary incompressible magnetohydrodynamics equations with variable density, viscos...
Lubomír Bañas, Andreas Prohl
KDD
2010
ACM
240views Data Mining» more  KDD 2010»
15 years 7 months ago
Diagnosing memory leaks using graph mining on heap dumps
Memory leaks are caused by software programs that prevent the reclamation of memory that is no longer in use. They can cause significant slowdowns, exhaustion of available storag...
Evan K. Maxwell, Godmar Back, Naren Ramakrishnan
MCU
2004
129views Hardware» more  MCU 2004»
15 years 4 months ago
Solving 3CNF-SAT and HPP in Linear Time Using WWW
We propose linear time solutions to two much celebrated NP-complete problems, namely the 3CNF-SAT and the directed Hamiltonian Path Problem (HPP), based on AHNEPs having all resour...
Florin Manea, Carlos Martín-Vide, Victor Mi...
148
Voted
PR
2008
170views more  PR 2008»
15 years 2 months ago
Annealing and the normalized N-cut
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
Tomás Gedeon, Albert E. Parker, Collette Ca...
GLOBECOM
2007
IEEE
15 years 9 months ago
Graph Theoretical Analysis of Opportunistic Scheduling Policy for Wireless Ad Hoc Networks
— 1 Taking advantage of the independent fading channel conditions among multiple wireless users, opportunistic transmissions schedule the user with the instantaneously best condi...
Qing Chen, Fei Ye, Zhisheng Niu