Sciweavers

101 search results - page 4 / 21
» The Intractability of Computing the Hamming Distance
Sort
View
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
14 years 10 days ago
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
Joshua Brody, Amit Chakrabarti
DATE
2003
IEEE
84views Hardware» more  DATE 2003»
13 years 11 months ago
Dynamic Functional Unit Assignment for Low Power
A hardware method for functional unit assignment is presented, based on the principle that a functional unit’s power consumption is approximated by the switching activity of its...
Steve Haga, Natasha Reeves, Rajeev Barua, Diana Ma...
ECBS
2011
IEEE
197views Hardware» more  ECBS 2011»
12 years 5 months ago
Finding Interaction Faults Adaptively Using Distance-Based Strategies
Abstract—Software systems are typically large and exhaustive testing of all possible input parameters is usually not feasible. Testers select tests that they anticipate may catch...
Renée C. Bryce, Charles J. Colbourn, D. Ric...
AH
2006
Springer
13 years 11 months ago
Ways of Computing Diverse Collaborative Recommendations
Abstract. Conversational recommender systems adapt the sets of products they recommend in light of user feedback. Our contribution here is to devise and compare four different mec...
Derek G. Bridge, John Paul Kelly
SODA
2008
ACM
89views Algorithms» more  SODA 2008»
13 years 7 months ago
Earth mover distance over high-dimensional spaces
The Earth Mover Distance (EMD) between two equalsize sets of points in Rd is defined to be the minimum cost of a bipartite matching between the two pointsets. It is a natural metr...
Alexandr Andoni, Piotr Indyk, Robert Krauthgamer