Sciweavers

537 search results - page 36 / 108
» A new upper bound for 3-SAT
Sort
View
TR
2008
107views more  TR 2008»
13 years 8 months ago
A New Shared Segment Protection Method for Survivable Networks with Guaranteed Recovery Time
Shared Segment Protection (SSP), compared with Shared Path Protection (SPP), and Shared Link Protection (SLP), provides an optimal protection configuration due to the ability of ma...
János Tapolcai, Pin-Han Ho, Dominique Verch...
ICALP
2005
Springer
14 years 2 months ago
Online Interval Coloring and Variants
We study interval coloring problems and present new upper and lower bounds for several variants. We are interested in four problems, online coloring of intervals with and without b...
Leah Epstein, Meital Levy
CVPR
2008
IEEE
14 years 10 months ago
A joint appearance-spatial distance for kernel-based image categorization
The goal of image categorization is to classify a collection of unlabeled images into a set of predefined classes to support semantic-level image retrieval. The distance measures ...
Guo-Jun Qi, Xian-Sheng Hua, Yong Rui, Jinhui Tang,...
TWC
2010
13 years 3 months ago
Random access transport capacity
Abstract--We develop a new metric for quantifying end-toend throughput in multihop wireless networks, which we term random access transport capacity, since the interference model p...
Jeffrey G. Andrews, Steven Weber, Marios Kountouri...
FOCS
2008
IEEE
14 years 3 months ago
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
Zoya Svitkina, Lisa Fleischer