Sciweavers

331 search results - page 27 / 67
» Using Redundant Constraints for Refinement
Sort
View
ASPDAC
2005
ACM
91views Hardware» more  ASPDAC 2005»
13 years 9 months ago
A Min-area Solution to Performance and RLC Crosstalk Driven Global Routing Problem
-- This paper presents a novel global routing algorithm, AT-PO-GR, to minimize the routing area under both congestion, timing, and RLC crosstalk constraints. The proposed algorithm...
Tong Jing, Ling Zhang, Jinghong Liang, Jingyu Xu, ...
TIP
2010
94views more  TIP 2010»
13 years 2 months ago
User-Friendly Interactive Image Segmentation Through Unified Combinatorial User Inputs
One weakness in the existing interactive image segmentation algorithms is the lack of more intelligent ways to understand the intention of user inputs. In this paper, we advocate t...
Wenxian Yang, Jianfei Cai, Jianmin Zheng, Jiebo Lu...
SDM
2004
SIAM
207views Data Mining» more  SDM 2004»
13 years 9 months ago
BAMBOO: Accelerating Closed Itemset Mining by Deeply Pushing the Length-Decreasing Support Constraint
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
Jianyong Wang, George Karypis
INFOCOM
2006
IEEE
14 years 1 months ago
Path Protection Routing with SRLG Constraints to Support IPTV in WDM Mesh Networks
— The distribution of broadcast TV across large provider networks has become a highly topical subject as satellite distribution capacity exhausts and competitive pressures increa...
Meeyoung Cha, Wanpracha Art Chaovalitwongse, Zihui...
CORR
2011
Springer
199views Education» more  CORR 2011»
12 years 11 months ago
Maximum Gain Round Trips with Cost Constraints
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applicat...
Franz Graf, Hans-Peter Kriegel, Matthias Schubert