Sciweavers

145 search results - page 24 / 29
» A new characterization of HH-free graphs
Sort
View
SMA
2008
ACM
173views Solid Modeling» more  SMA 2008»
14 years 9 months ago
Visibility-based feature extraction from discrete models
In this paper, we present a new visibility-based feature extraction algorithm from discrete models as dense point clouds resulting from laser scans. Based on the observation that ...
Antoni Chica
TON
2008
122views more  TON 2008»
14 years 9 months ago
Distributed throughput maximization in wireless mesh networks via pre-partitioning
Abstract-- This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number ...
Andrew Brzezinski, Gil Zussman, Eytan Modiano
KAIS
2010
139views more  KAIS 2010»
14 years 8 months ago
Periodic subgraph mining in dynamic networks
In systems of interacting entities such as social networks, interactions that occur regularly typically correspond to significant, yet often infrequent and hard to detect, interact...
Mayank Lahiri, Tanya Y. Berger-Wolf
IFIP
2010
Springer
14 years 4 months ago
Information Flow Analysis via Path Condition Refinement
We present a new approach to information flow control (IFC), ploits counterexample-guided abstraction refinement (CEGAR) technology. The CEGAR process is built on top of our existi...
Mana Taghdiri, Gregor Snelting, Carsten Sinz
CVPR
2012
IEEE
13 years 2 days ago
Sum-product networks for modeling activities with stochastic structure
This paper addresses recognition of human activities with stochastic structure, characterized by variable spacetime arrangements of primitive actions, and conducted by a variable ...
Mohamed R. Amer, Sinisa Todorovic