14190 search results - page 2457 / 2838 » computing 2008 |
142
click to vote
JALC
2007
15 years 4 months ago
2007
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...
121
Voted
TIT
2008
15 years 4 months ago
2008
We study the task of transforming a hard function f, with which any small circuit disagrees on (1 - )/2 fraction of the input, into a harder function f , with which any small circ...
169
click to vote
TKDE
2008
15 years 4 months ago
2008
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
157
click to vote
TKDE
2008
15 years 4 months ago
2008
With the availability of affordable sensors and sensor networks, sensor-based human-activity recognition has attracted much attention in artificial intelligence and ubiquitous comp...
157
click to vote
TMC
2008
15 years 4 months ago
2008
In this research, we first investigate the cross-layer interaction between TCP and routing protocols in the IEEE 802.11 ad hoc network. On-demand ad hoc routing protocols respond t...