1469 search results - page 44 / 294 » Characterizing the Structural Complexity of Real-World Compl... |
SIGMOD
2003
ACM
14 years 9 months ago
2003
ACM
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...
ICNC
2005
Springer
14 years 2 months ago
2005
Springer
Advances in grid computing have recently sparkled the research and development of Grid problem solving environments for complex design. Parallelism in the form of distributed compu...
EDBT
2009
ACM
14 years 1 days ago
2009
ACM
Constructing Haar wavelet synopses under a given approximation error has many real world applications. In this paper, we take a novel approach towards constructing unrestricted Ha...
AAAI
2008
13 years 11 months ago
2008
Probabilistic modeling has been a dominant approach in Machine Learning research. As the field evolves, the problems of interest become increasingly challenging and complex. Makin...
INFOCOM
2007
IEEE
14 years 3 months ago
2007
IEEE
— In this paper, we present an O(1) time-complexity packet scheduling algorithm which we call G-3 that provides bounded end-to-end delay for fixed size packet networks. G-3 is b...