Sciweavers

4110 search results - page 644 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
KDD
2009
ACM
185views Data Mining» more  KDD 2009»
16 years 7 months ago
On compressing social networks
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, ...
AINA
2006
IEEE
16 years 16 days ago
Peer-Tree: A Hybrid Peer-to-Peer Overlay for Service Discovery
Efficient service discovery in dynamic, crossorganizational VO is one of the challenge aspects in ChinaGrid. Network overlay and search algorithms are two important considerations...
Jing Tie, Hai Jin, Shengli Li, Xuanhua Shi, Hanhua...
CVPR
2009
IEEE
17 years 1 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
ICIP
2004
IEEE
16 years 8 months ago
Scalable predictive coding by nested quantization with layered side information
An efficient scalable predictive coding method is proposed for the Wyner-Ziv problem, using nested lattice quantization followed by multi-layer Slepian-Wolf coders (SWC) with laye...
Huisheng Wang, Antonio Ortega
ICDE
2008
IEEE
146views Database» more  ICDE 2008»
16 years 7 months ago
Handling Uncertain Data in Array Database Systems
Scientific and intelligence applications have special data handling needs. In these settings, data does not fit the standard model of short coded records that had dominated the dat...
Tingjian Ge, Stanley B. Zdonik