Sciweavers

429 search results - page 36 / 86
» Solving the Maximum Clique Problem Using PUBB
Sort
View
ECCV
2004
Springer
14 years 9 months ago
Sparse Finite Elements for Geodesic Contours with Level-Sets
Level-set methods have been shown to be an effective way to solve optimisation problems that involve closed curves. They are well known for their capacity to deal with flexible top...
Martin Weber, Andrew Blake, Roberto Cipolla
ICDCS
2008
IEEE
14 years 2 months ago
Multi-Site Retrieval of Declustered Data
Declustering techniques reduce query response times through parallel I/O by distributing data among multiple devices. Recently, replication based approaches were proposed to furth...
Ali Saman Tosun
ESA
2009
Springer
92views Algorithms» more  ESA 2009»
14 years 2 months ago
Minimizing Movement: Fixed-Parameter Tractability
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...
Erik D. Demaine, MohammadTaghi Hajiaghayi, D&aacut...
TODAES
2002
134views more  TODAES 2002»
13 years 7 months ago
False-noise analysis using logic implications
ct Cross-coupled noise analysis has become a critical concern in today's VLSI designs. Typically, noise analysis makes an assumption that all aggressing nets can simultaneousl...
Alexey Glebov, Sergey Gavrilov, David Blaauw, Vlad...
CORR
2010
Springer
204views Education» more  CORR 2010»
13 years 7 months ago
Optimization Framework and Graph-Based Approach for Relay-Assisted Bidirectional OFDMA Cellular Networks
This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using orthogonal frequencydivision multi...
Yuan Liu, Meixia Tao, Bin Li, Hui Shen