Sciweavers

2969 search results - page 213 / 594
» A space efficient algorithm for group structure computation
Sort
View
ECCV
2006
Springer
16 years 5 months ago
Efficient Belief Propagation with Learned Higher-Order Markov Random Fields
Belief propagation (BP) has become widely used for low-level vision problems and various inference techniques have been proposed for loopy graphs. These methods typically rely on a...
Xiangyang Lan, Stefan Roth, Daniel P. Huttenlocher...
TROB
2008
159views more  TROB 2008»
15 years 3 months ago
Distributed Connectivity Control of Mobile Networks
Control of mobile networks raises fundamental and novel problems in controlling the structure of the resulting dynamic graphs. In particular, in applications involving mobile senso...
Michael M. Zavlanos, George J. Pappas
131
Voted
TVCG
2010
165views more  TVCG 2010»
14 years 10 months ago
Binary Mesh Partitioning for Cache-Efficient Visualization
Abstract--One important bottleneck when visualizing large data sets is the data transfer between processor and memory. Cacheaware (CA) and cache-oblivious (CO) algorithms take into...
Marc Tchiboukdjian, Vincent Danjean, Bruno Raffin
JIIS
2002
99views more  JIIS 2002»
15 years 3 months ago
Efficient Management of Persistent Knowledge
Although computer speed has steadily increased and memory is getting cheaper, the need for storage managers to deal efficiently with applications that cannot be held into main memo...
Dimitris G. Kapopoulos, Michael Hatzopoulos, Panag...
147
Voted
IV
2003
IEEE
91views Visualization» more  IV 2003»
15 years 9 months ago
Labeled Radial Drawing of Data Structures
This paper describes a radial layout method for displaying B+ -tree data structures. We present an algorithmic framework for computing the node positions that result in a planar d...
M. Bernard, S. Mohammed