Sciweavers

4908 search results - page 966 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
83
Voted
CN
2006
116views more  CN 2006»
14 years 11 months ago
Techniques for available bandwidth measurement in IP networks: A performance comparison
As the Internet grows in scale and complexity, the need for accurate traffic measurement increases. Among the different parameters relevant to traffic measurement, the paper pays ...
Leopoldo Angrisani, Salvatore D'Antonio, Marcello ...
COMCOM
2006
105views more  COMCOM 2006»
14 years 11 months ago
An observation-based approach towards self-managing web servers
As more business applications have become web enabled, the web server architecture has evolved to provide performance isolation, service differentiation, and QoS guarantees. Vario...
Abhishek Chandra, Prashant Pradhan, Renu Tewari, S...
COMCOM
2006
147views more  COMCOM 2006»
14 years 11 months ago
Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks
Due to the application-specific nature of wireless sensor networks, application-aware algorithm and protocol design paradigms are highly required in order to optimize the overall ...
Wook Choi, Sajal K. Das
CORR
2006
Springer
160views Education» more  CORR 2006»
14 years 11 months ago
Frugality ratios and improved truthful mechanisms for vertex cover
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
BMCBI
2007
166views more  BMCBI 2007»
14 years 11 months ago
How to decide which are the most pertinent overly-represented features during gene set enrichment analysis
Background: The search for enriched features has become widely used to characterize a set of genes or proteins. A key aspect of this technique is its ability to identify correlati...
Roland Barriot, David J. Sherman, Isabelle Dutour