Sciweavers

1274 search results - page 234 / 255
» Graph lambda theories
Sort
View
ECCC
2006
145views more  ECCC 2006»
13 years 7 months ago
Constraint satisfaction: a personal perspective
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
Tomás Feder
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 7 months ago
On Compact Routing for the Internet
The Internet’s routing system is facing stresses due to its poor fundamental scaling properties. Compact routing is a research field that studies fundamental limits of routing ...
Dmitri V. Krioukov, Kimberly C. Claffy, Kevin R. F...
CIKM
2010
Springer
13 years 6 months ago
A structured approach to query recommendation with social annotation data
Query recommendation has been recognized as an important mean to help users search and also improve the usability of search engines. Existing approaches mainly focus on helping us...
Jiafeng Guo, Xueqi Cheng, Gu Xu, Huawei Shen
CIKM
2010
Springer
13 years 6 months ago
SHRINK: a structural clustering algorithm for detecting hierarchical communities in networks
Community detection is an important task for mining the structure and function of complex networks. Generally, there are several different kinds of nodes in a network which are c...
Jianbin Huang, Heli Sun, Jiawei Han, Hongbo Deng, ...
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
13 years 6 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...