Sciweavers

117 search results - page 18 / 24
» What do we know about the Metropolis algorithm
Sort
View
WSDM
2012
ACM
300views Data Mining» more  WSDM 2012»
12 years 3 months ago
Adding semantics to microblog posts
Microblogs have become an important source of information for the purpose of marketing, intelligence, and reputation management. Streams of microblogs are of great value because o...
Edgar Meij, Wouter Weerkamp, Maarten de Rijke
ECCV
2000
Springer
14 years 9 months ago
Kruppa Equation Revisited: Its Renormalization and Degeneracy
In this paper, we study general questions about the solvability of the Kruppa equations and show that, in several special cases, the Kruppa equations can be renormalized and becom...
Jana Kosecka, René Vidal, Shankar Sastry, Y...
TON
2010
221views more  TON 2010»
13 years 2 months ago
Minimum-Cost Multiple Paths Subject to Minimum Link and Node Sharing in a Network
Abstract--In communication networks, multiple disjoint communication paths are desirable for many applications. Such paths, however, may not exist in a network. In such a situation...
S. Q. Zheng, Jianping Wang, Bing Yang, Mei Yang
CAV
2008
Springer
131views Hardware» more  CAV 2008»
13 years 9 months ago
Validating High-Level Synthesis
The growing design-productivity gap has made designers shift toward using high-level languages like C, C++ and Java to do system-level design. High-Level Synthesis (HLS) is the pro...
Sudipta Kundu, Sorin Lerner, Rajesh Gupta
INFOCOM
2008
IEEE
14 years 1 months ago
Randomized 3D Geographic Routing
—We reconsider the problem of geographic routing in wireless ad hoc networks. We are interested in local, memoryless routing algorithms, i.e. each network node bases its routing ...
Roland Flury, Roger Wattenhofer