4112 search results - page 545 / 823 » Efficient Algorithms for the Spoonerism Problem |
219
click to vote
EOR
2010
15 years 7 months ago
2010
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
193
click to vote
TIT
2008
15 years 7 months ago
2008
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
235
click to vote
KAIS
2002
15 years 7 months ago
2002
A great challenge for web site designers is how to ensure users' easy access to important web pages efficiently. In this paper we present a clustering-based approach to addres...
261
click to vote
IPPS
2010
IEEE
15 years 5 months ago
2010
IEEE
In this work we consider the problem of monitoring information streams for anomalies in a scalable and efficient manner. We study the problem in the context of network streams wher...
213
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...