Sciweavers

1210 search results - page 242 / 242
» Specifying Precise Use Cases with Use Case Charts
Sort
View
WWW
2011
ACM
12 years 11 months ago
Improving recommendation for long-tail queries via templates
The ability to aggregate huge volumes of queries over a large population of users allows search engines to build precise models for a variety of query-assistance features such as ...
Idan Szpektor, Aristides Gionis, Yoelle Maarek
DAC
2011
ACM
12 years 4 months ago
DRAIN: distributed recovery architecture for inaccessible nodes in multi-core chips
As transistor dimensions continue to scale deep into the nanometer regime, silicon reliability is becoming a chief concern. At the same time, transistor counts are scaling up, ena...
Andrew DeOrio, Konstantinos Aisopos, Valeria Berta...
MOBICOM
2004
ACM
13 years 10 months ago
Practical robust localization over large-scale 802.11 wireless networks
We demonstrate a system built using probabilistic techniques that allows for remarkably accurate localization across our entire office building using nothing more than the built-...
Andreas Haeberlen, Eliot Flannery, Andrew M. Ladd,...
FUN
2010
Springer
312views Algorithms» more  FUN 2010»
13 years 9 months ago
On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching
Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of Parikh vector q (a “jumbled string”) in the tex...
Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, ...
JSYML
2010
114views more  JSYML 2010»
13 years 3 months ago
The Ackermann functions are not optimal, but by how much?
By taking a closer look at the construction of an Ackermann function we see that between any primitive recursive degree and its Ackermann modification there is a dense chain of p...
Harold Simmons