Sciweavers

1091 search results - page 180 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
INFOCOM
2007
IEEE
14 years 2 months ago
Acyclic Type of Relationships Between Autonomous Systems
Abstract— The Internet connectivity in the Autonomous System (AS) level reflects the commercial relationship between ASes. A connection between two ASes could be of type custome...
Rami Cohen, Danny Raz
CVPR
2009
IEEE
15 years 3 months ago
Global Connectivity Potentials for Random Field Models
Markov random field (MRF, CRF) models are popular in computer vision. However, in order to be computationally tractable they are limited to incorporate only local interactions a...
Sebastian Nowozin, Christoph H. Lampert
ICPP
2007
IEEE
14 years 2 months ago
Architectural Challenges in Memory-Intensive, Real-Time Image Forming
The real-time image forming in future, high-end synthetic aperture radar systems is an example of an application that puts new demands on computer architectures. The initial quest...
Anders Ahlander, H. Hellsten, K. Lind, J. Lindgren...
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
14 years 2 months ago
Fast Evaluation of Union-Intersection Expressions
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Philip Bille, Anna Pagh, Rasmus Pagh
ICDE
1999
IEEE
148views Database» more  ICDE 1999»
14 years 9 months ago
Efficient Mining of Partial Periodic Patterns in Time Series Database
Partial periodicity search, i.e., search for partial periodic patterns in time-series databases, is an interesting data mining problem. Previous studies on periodicity search main...
Jiawei Han, Guozhu Dong, Yiwen Yin