Sciweavers

7189 search results - page 60 / 1438
» Connecting Design with Code
Sort
View
DAGM
2008
Springer
13 years 12 months ago
MAP-Inference for Highly-Connected Graphs with DC-Programming
The design of inference algorithms for discrete-valued Markov Random Fields constitutes an ongoing research topic in computer vision. Large state-spaces, none-submodular energy-fun...
Jörg H. Kappes, Christoph Schnörr
WICON
2008
13 years 11 months ago
An experimental study on connectivity and topology control in real multi-hop wireless networks
Topology control by means of transmit power adjustment is a well-studied technique for improving the network capacity and energy efficiency of wireless ad hoc networks. In this pa...
Alvin C. Valera, Pius W. Q. Lee, Yew Fai Wong, Win...
IJWIN
2006
209views more  IJWIN 2006»
13 years 10 months ago
On Connected Multiple Point Coverage in Wireless Sensor Networks
Abstract-- We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a s...
Shuhui Yang, Fei Dai, Mihaela Cardei, Jie Wu, Floy...
HICSS
2011
IEEE
179views Biometrics» more  HICSS 2011»
13 years 1 months ago
EventGraphs: Charting Collections of Conference Connections
EventGraphs are social media network diagrams of conversations related to events, such as conferences. Many conferences now communicate a common “hashtag” or keyword to identi...
Derek L. Hansen, Marc A. Smith, Ben Shneiderman
TIT
1998
127views more  TIT 1998»
13 years 9 months ago
The Art of Signaling: Fifty Years of Coding Theory
—In 1948 Shannon developed fundamental limits on the efficiency of communication over noisy channels. The coding theorem asserts that there are block codes with code rates arbit...
A. Robert Calderbank