4095 search results - page 345 / 819 » How to test a tree |
156
click to vote
RECOMB
2006
Springer
16 years 5 months ago
2006
Springer
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
149
click to vote
STOC
2007
ACM
16 years 5 months ago
2007
ACM
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
158
click to vote
STOC
2004
ACM
16 years 5 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
245
click to vote
SIGMOD
2009
ACM
16 years 5 months ago
2009
ACM
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
191
click to vote
ASIAMS
2007
IEEE
15 years 12 months ago
2007
IEEE
This talk has two parts explaining the significance of Rough sets in granular computing in terms of rough set rules and in uncertainty handling in terms of lower and upper approxi...