Sciweavers

2362 search results - page 348 / 473
» A new approach to edge detection
Sort
View
ACTA
2007
92views more  ACTA 2007»
15 years 1 months ago
Solving #SAT using vertex covers
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
CORR
2007
Springer
135views Education» more  CORR 2007»
15 years 1 months ago
Multiple resolution of the modular structure of complex networks
Modular structure is ubiquitous in real-world complex networks. The detection of this type of organization into modules gives insights in the relationship between topological stru...
Alex Arenas, Alberto Fernández, Sergio G&oa...
TCOM
2008
63views more  TCOM 2008»
15 years 1 months ago
A general construction of constrained parity-check codes for optical recording
This paper proposes a general and systematic code design method to efficiently combine constrained codes with parity-check (PC) codes for optical recording. The proposed constraine...
Kui Cai, Kees A. Schouhamer Immink
TMI
2008
138views more  TMI 2008»
15 years 1 months ago
Accurate Event-Driven Motion Compensation in High-Resolution PET Incorporating Scattered and Random Events
With continuing improvements in spatial resolution of positron emission tomography (PET) scanners, small patient movements during PET imaging become a significant source of resolut...
Arman Rahmim, Katie Dinelle, Ju-Chieh Cheng, Mikha...
CORR
2010
Springer
107views Education» more  CORR 2010»
15 years 5 hour ago
Maximum Betweenness Centrality: Approximability and Tractable Cases
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
Martin Fink, Joachim Spoerhase