Sciweavers

712 search results - page 121 / 143
» A mixture model for random graphs
Sort
View
INFOCOM
2008
IEEE
14 years 2 months ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
14 years 1 months ago
Stability in the self-organized evolution of networks
The modeling and analysis of large networks of autonomous agents is an important topic with applications in many different disciplines. One way of modeling the development of such...
Thomas Jansen, Madeleine Theile
IJVR
2008
208views more  IJVR 2008»
13 years 6 months ago
A View-based Multiple Objects Tracking and Human Action Recognition for Interactive Virtual Environments
As environments become smart in accordance with advances in ubiquitous computing technology, researchers are struggling to satisfy users' diverse and sophisticated demands. Th...
Jin Choi, Yong-il Cho, Kyusung Cho, Su-jung Bae, H...
ICPR
2008
IEEE
14 years 9 months ago
HOPS: Efficient region labeling using Higher Order Proxy Neighborhoods
We present the Higher Order Proxy Neighborhoods (HOPS) approach to modeling higher order neighborhoods in Markov Random Fields (MRFs). HOPS incorporates more context information i...
Albert Y. C. Chen, Jason J. Corso, Le Wang
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
14 years 1 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki