Sciweavers

5100 search results - page 934 / 1020
» The Linear Complexity of a Graph
Sort
View
120
Voted
WWW
2006
ACM
16 years 5 months ago
Site level noise removal for search engines
The currently booming search engine industry has determined many online organizations to attempt to artificially increase their ranking in order to attract more visitors to their ...
André Luiz da Costa Carvalho, Paul-Alexandr...
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
16 years 4 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami
ICDCS
2009
IEEE
16 years 1 months ago
Q-Tree: A Multi-Attribute Based Range Query Solution for Tele-immersive Framework
Users and administrators of large distributed systems are frequently in need of monitoring and management of its various components, data items and resources. Though there exist s...
Md. Ahsan Arefin, Md. Yusuf Sarwar Uddin, Indranil...
COCOON
2009
Springer
15 years 11 months ago
On the Generalised Character Compatibility Problem for Non-branching Character Trees
In [3], the authors introduced the Generalised Character Compatibility Problem as a generalisation of the Perfect Phylogeny Problem for a set of species. This generalised problem t...
Ján Manuch, Murray Patterson, Arvind Gupta
157
Voted
ESA
2009
Springer
122views Algorithms» more  ESA 2009»
15 years 11 months ago
Bounded Budget Betweenness Centrality Game for Strategic Network Formations
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhan...