Sciweavers

5244 search results - page 47 / 1049
» When are two algorithms the same
Sort
View
PE
2008
Springer
167views Optimization» more  PE 2008»
13 years 7 months ago
Analysis of ratings on trust inference in open environments
Ratings (also known as recommendations) provide an efficient and effective way to build trust relationship in the human society, by making use of the information from others rathe...
Zhengqiang Liang, Weisong Shi
INFOCOM
2009
IEEE
14 years 2 months ago
Hardness and Approximation of the Survivable Multi-Level Fat Tree Problem
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...
Hung Q. Ngo, Thanh-Nhan Nguyen, Dahai Xu
CVPR
2008
IEEE
14 years 9 months ago
Consistent image analogies using semi-supervised learning
In this paper we study the following problem: given two source images A and A , and a target image B, can we learn to synthesize a new image B which relates to B in the same way t...
Li Cheng, S. V. N. Vishwanathan, Xinhua Zhang
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
14 years 1 months ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia
FCT
2005
Springer
14 years 1 months ago
A New Linearizing Restriction in the Pattern Matching Problem
In the pattern matching problem, there can be a quadratic number of matching substrings in the size of a given text. The linearizing restriction finds, at most, a linear number of...
Yo-Sub Han, Derick Wood