Sciweavers

10988 search results - page 2124 / 2198
» Algorithmic Folding Complexity
Sort
View
135
Voted
PODC
2004
ACM
15 years 8 months ago
Gradient clock synchronization
We introduce the distributed gradient clock synchronization problem. As in traditional distributed clock synchronization, we consider a network of nodes equipped with hardware clo...
Rui Fan, Nancy A. Lynch
PODC
2004
ACM
15 years 8 months ago
Mechanism design for policy routing
The Border Gateway Protocol (BGP) for interdomain routing is designed to allow autonomous systems (ASes) to express policy preferences over alternative routes. We model these pref...
Joan Feigenbaum, Rahul Sami, Scott Shenker
139
Voted
SIGIR
2004
ACM
15 years 8 months ago
An effective approach to document retrieval via utilizing WordNet and recognizing phrases
Noun phrases in queries are identified and classified into four types: proper names, dictionary phrases, simple phrases and complex phrases. A document has a phrase if all content...
Shuang Liu, Fang Liu, Clement T. Yu, Weiyi Meng
124
Voted
SIGMETRICS
2004
ACM
118views Hardware» more  SIGMETRICS 2004»
15 years 8 months ago
A game theoretic approach to provide incentive and service differentiation in P2P networks
Traditional Peer-to-Peer (P2P) networks do not provide service differentiation and incentive for users. Consequently, users can easily access information without contributing any ...
Richard T. B. Ma, Sam C. M. Lee, John C. S. Lui, D...
115
Voted
COCO
2004
Springer
84views Algorithms» more  COCO 2004»
15 years 8 months ago
Properties of NP-Complete Sets
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
Christian Glaßer, Aduri Pavan, Alan L. Selma...
« Prev « First page 2124 / 2198 Last » Next »