Sciweavers

2612 search results - page 344 / 523
» Switching Graphs and Their Complexity
Sort
View

Publication
200views
14 years 3 months ago
Tracking Endocardial Motion via Multiple Model Filtering of Distribution Cut
Tracking heart motion plays an essential role in the diagnosis of cardiovascular diseases. As such, accurate characterization of dynamic behavior of the left ventricle (LV) is esse...
Kumaradevan Punithakumar, Ismail Ben Ayed, Ali Isl...
ADT
2011
14 years 8 months ago
Virtual networks: isolation, performance, and trends
Currently, there is a strong effort of the research community in rethinking the Internet architecture to cope with its current limitations and support new requirements. Many resea...
Natalia Castro Fernandes, Marcelo D. D. Moreira, I...
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
16 years 5 months ago
The detectability lemma and quantum gap amplification
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...
WAW
2004
Springer
178views Algorithms» more  WAW 2004»
15 years 9 months ago
Communities Detection in Large Networks
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
Andrea Capocci, Vito Domenico Pietro Servedio, Gui...
LCC
1994
248views Algorithms» more  LCC 1994»
15 years 8 months ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin