Sciweavers

1429 search results - page 36 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
FOCS
2007
IEEE
14 years 1 months ago
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
Kousha Etessami, Mihalis Yannakakis
GRID
2003
Springer
14 years 23 days ago
Scoped and Approximate Queries in a Relational Grid Information Service
We are developing a grid information service, RGIS, that is based on the relational data model. RGIS supports complex queries written in SQL that search for compositions (using jo...
Dong Lu, Peter A. Dinda, Jason A. Skicewicz
JCO
2006
150views more  JCO 2006»
13 years 7 months ago
Efficient algorithms for shared backup allocation in networks with partial information
Abstract. We study efficient algorithms for establishing reliable connections with bandwidth guarantees in communication networks. In the normal mode of operation, each connection ...
Yigal Bejerano, Joseph Naor, Alexander Sprintson
INFOCOM
2009
IEEE
14 years 2 months ago
Link Scheduling with QoS Guarantee for Wireless Relay Networks
—The emerging wireless relay networks (WRNs) are expected to provide significant improvement on throughput and extension of coverage area for next-generation wireless systems. W...
Chi-Yao Hong, Ai-Chun Pang
COMPSAC
2004
IEEE
13 years 11 months ago
On the Complexity of Finding Emerging Patterns
Emerging patterns have been studied as a useful type of pattern for the diagnosis and understanding of diseases based on the analysis of gene expression profiles. They are useful ...
Lusheng Wang, Hao Zhao, Guozhu Dong, Jianping Li