Sciweavers

4926 search results - page 733 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
AAAI
2012
11 years 10 months ago
Dynamic Matching via Weighted Myopia with Application to Kidney Exchange
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
John P. Dickerson, Ariel D. Procaccia, Tuomas Sand...
PERVASIVE
2009
Springer
14 years 3 months ago
RF-Based Initialisation for Inertial Pedestrian Tracking
Location information is an important source of context for ubiquitous computing systems. We have previously developed a wearable location system that combines a foot-mounted inerti...
Oliver Woodman, Robert Harle
WISEC
2010
ACM
14 years 3 months ago
Timing-based localization of in-band wormhole tunnels in MANETs
The problem of localizing in-band wormhole tunnels in MANETs is considered. In an in-band wormhole attack, colluding attackers use a covert tunnel to create the illusion that two ...
Jinsub Kim, Dan Sterne, Rommie Hardy, Roshan K. Th...
ASPDAC
2000
ACM
159views Hardware» more  ASPDAC 2000»
14 years 19 days ago
Analytical minimization of half-perimeter wirelength
Global placement of hypergraphs is critical in the top-down placement of large timing-driven designs 10, 16 . Placement quality is evaluated in terms of the half-perimeter wirelen...
Andrew A. Kennings, Igor L. Markov
SIGIR
2002
ACM
13 years 8 months ago
Predicting query performance
We develop a method for predicting query performance by computing the relative entropy between a query language model and the corresponding collection language model. The resultin...
Stephen Cronen-Townsend, Yun Zhou, W. Bruce Croft