Sciweavers

3257 search results - page 125 / 652
» Some Results on Effective Randomness
Sort
View
ICDCSW
2008
IEEE
15 years 4 months ago
Heuristic Relay Node Selection Algorithm for One-Hop Overlay Routing
—This paper reviews the characteristics of overlay networks and defines effective relay nodes that can improve the performance of interactive real-time applications. A heuristic ...
Yin Chen, Li Tang, Jun Li
NAACL
2007
14 years 11 months ago
Worst-Case Synchronous Grammar Rules
We relate the problem of finding the best application of a Synchronous ContextFree Grammar (SCFG) rule during parsing to a Markov Random Field. This representation allows us to u...
Daniel Gildea, Daniel Stefankovic
AAAI
1994
14 years 11 months ago
In Search of the Best Constraint Satisfaction Search
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...
Daniel Frost, Rina Dechter
PODS
2003
ACM
156views Database» more  PODS 2003»
15 years 10 months ago
Limiting privacy breaches in privacy preserving data mining
There has been increasing interest in the problem of building accurate data mining models over aggregate data, while protecting privacy at the level of individual records. One app...
Alexandre V. Evfimievski, Johannes Gehrke, Ramakri...
CORR
2010
Springer
62views Education» more  CORR 2010»
14 years 10 months ago
Guessing Revisited: A Large Deviations Approach
The problem of guessing a random string is revisited and some prior results on guessing exponents are re-derived using the theory of large deviations. It is shown that if the seque...
Manjesh Kumar Hanawal, Rajesh Sundaresan