Sciweavers

4377 search results - page 728 / 876
» Mass problems and randomness
Sort
View
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
15 years 1 months ago
Approximating Average Parameters of Graphs
Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we consider the average ...
Oded Goldreich, Dana Ron
BROADNETS
2006
IEEE
15 years 1 months ago
On Traffic Grooming Choices for IP over WDM networks
Traffic grooming continues to be a rich area of research in the context of WDM optical networks. We provide an overview of the optical and electronic grooming techniques available...
Srivatsan Balasubramanian, Arun K. Somani
CIVR
2006
Springer
219views Image Analysis» more  CIVR 2006»
15 years 1 months ago
Bayesian Learning of Hierarchical Multinomial Mixture Models of Concepts for Automatic Image Annotation
We propose a novel Bayesian learning framework of hierarchical mixture model by incorporating prior hierarchical knowledge into concept representations of multi-level concept struc...
Rui Shi, Tat-Seng Chua, Chin-Hui Lee, Sheng Gao
CP
2006
Springer
15 years 1 months ago
Towards an Efficient SAT Encoding for Temporal Reasoning
Abstract. In this paper, we investigate how an IA network can be effectively encoded into the SAT domain. We propose two basic approaches to modelling an IA network as a CSP: one r...
Duc Nghia Pham, John Thornton, Abdul Sattar
FTDCS
2004
IEEE
15 years 1 months ago
A New Perspective in Defending against DDoS
Distributed denial of service (DDoS) is a major threat to the availability of Internet services. The anonymity allowed by IP networking, together with the distributed, large scale...
Shigang Chen, Randy Chow