Sciweavers

278 search results - page 55 / 56
» Algorithmic randomness and monotone complexity on product sp...
Sort
View
IS
2010
13 years 5 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley
ICIP
2002
IEEE
14 years 9 months ago
Efficient video similarity measurement with video signature
The proliferation of video content on the web makes similarity detection an indispensable tool in web data management, searching, and navigation. In this paper, we propose a numbe...
Sen-Ching S. Cheung, Avideh Zakhor
LICS
2000
IEEE
13 years 11 months ago
Concurrent Omega-Regular Games
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose ...
Luca de Alfaro, Thomas A. Henzinger
BMCBI
2008
214views more  BMCBI 2008»
13 years 7 months ago
Accelerating String Set Matching in FPGA Hardware for Bioinformatics Research
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
Yoginder S. Dandass, Shane C. Burgess, Mark Lawren...
ISCC
2002
IEEE
122views Communications» more  ISCC 2002»
14 years 8 days ago
Efficiency/friendliness tradeoffs in TCP Westwood
In this paper, we propose a refinement of TCP Westwood allowing the management of the Efficiency/Friendliness-toNewReno tradeoff. We show that the refined TCP Westwood is able to ...
Ren Wang, Massimo Valla, M. Y. Sanadidi, Bryan K. ...