Sciweavers

1450 search results - page 120 / 290
» On the Complexity of Hardness Amplification
Sort
View
TKDE
2008
121views more  TKDE 2008»
13 years 9 months ago
On Modularity Clustering
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
Ulrik Brandes, Daniel Delling, Marco Gaertler, Rob...
TOG
2008
120views more  TOG 2008»
13 years 9 months ago
Real-time, all-frequency shadows in dynamic scenes
Shadow computation in dynamic scenes under complex illumination is a challenging problem. Methods based on precomputation provide accurate, real-time solutions, but are hard to ex...
Thomas Annen, Zhao Dong, Tom Mertens, Philippe Bek...
TSP
2008
95views more  TSP 2008»
13 years 9 months ago
Pilotless Frame Synchronization for LDPC-Coded Transmission Systems
Abstract--We present a pilotless frame synchronization approach that exploits feedback from a low-density parity-check (LDPC) code decoder. The synchronizer is based on syndrome ch...
Dong-U Lee, Hyungjin Kim, Christopher R. Jones, Jo...
JOT
2007
99views more  JOT 2007»
13 years 9 months ago
On Flash-Based DBMSs: Issues for Architectural Re-Examination
Flash memory is being rapidly deployed as data storage for mobile devices. Flash memory offers many advantages over hard disk, and considering its rapid technical improvement both...
Sang-Won Lee, Won Kim
CORR
2000
Springer
133views Education» more  CORR 2000»
13 years 9 months ago
On Exponential-Time Completeness of the Circularity Problem for Attribute Grammars
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
Pei-Chi Wu