Sciweavers

15485 search results - page 3073 / 3097
» Computing Optimal Subsets
Sort
View
JALC
2007
90views more  JALC 2007»
13 years 7 months ago
Learning Unary Automata
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
Gregor Gramlich, Ralf Herrmann
BMCBI
2005
306views more  BMCBI 2005»
13 years 7 months ago
A method for aligning RNA secondary structures and its application to RNA motif detection
Background: Alignment of RNA secondary structures is important in studying functional RNA motifs. In recent years, much progress has been made in RNA motif finding and structure a...
Jianghui Liu, Jason Tsong-Li Wang, Jun Hu, Bin Tia...
TPDS
2008
150views more  TPDS 2008»
13 years 7 months ago
Mitosis: A Speculative Multithreaded Processor Based on Precomputation Slices
This paper presents the Mitosis framework, which is a combined hardware-software approach to speculative multithreading, even in the presence of frequent dependences among threads....
Carlos Madriles, Carlos García Quiño...
JSAC
2007
180views more  JSAC 2007»
13 years 7 months ago
A Cross-Layer Approach for WLAN Voice Capacity Planning
— This paper presents an analytical approach to determining the maximum number of on/off voice flows that can be supported over a wireless local area network (WLAN), under a qua...
Yu Cheng, Xinhua Ling, Wei Song, Lin X. Cai, Weihu...
WWW
2008
ACM
13 years 7 months ago
Divide, Compress and Conquer: Querying XML via Partitioned Path-Based Compressed Data Blocks
We propose a novel Partition Path-Based (PPB) grouping strategy to store compressed XML data in a stream of blocks. In addition, we employ a minimal indexing scheme called Block S...
Wilfred Ng, Ho Lam Lau, Aoying Zhou
« Prev « First page 3073 / 3097 Last » Next »