Sciweavers

5523 search results - page 733 / 1105
» Improving application performance with hardware data structu...
Sort
View
CP
2007
Springer
15 years 10 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
ICDE
2009
IEEE
178views Database» more  ICDE 2009»
15 years 4 months ago
Efficient Query Evaluation over Temporally Correlated Probabilistic Streams
Many real world applications such as sensor networks and other monitoring applications naturally generate probabilistic streams that are highly correlated in both time and space. ...
Bhargav Kanagal, Amol Deshpande
INFOCOM
2012
IEEE
13 years 9 months ago
Origin-destination flow measurement in high-speed networks
—An origin-destination (OD) flow between two routers is the set of packets that pass both routers in a network. Measuring the sizes of OD flows is important to many network man...
Tao Li, Shigang Chen, Yan Qiao
CVPR
2008
IEEE
16 years 8 months ago
Sparsity, redundancy and optimal image support towards knowledge-based segmentation
In this paper, we propose a novel approach to model shape variations. It encodes sparsity, exploits geometric redundancy, and accounts for the different degrees of local variation...
Salma Essafi, Georg Langs, Nikos Paragios
NOMS
2008
IEEE
139views Communications» more  NOMS 2008»
16 years 1 months ago
Fast similarity search in peer-to-peer networks
Abstract—Peer-to-peer (P2P) systems show numerous advantages over centralized systems, such as load balancing, scalability, and fault tolerance, and they require certain function...
Thomas Bocek, Ela Hunt, David Hausheer, Burkhard S...