Sciweavers

6110 search results - page 753 / 1222
» Approximate Computing
Sort
View
IJBRA
2007
89views more  IJBRA 2007»
15 years 6 months ago
Conservative adjustment of permutation p-values when the number of permutations is limited
The permutation procedure is widely used to assess the significance level (p-value) of a test statistic. This approach is asymptotically consistent. In genomics and proteomics st...
Yinglei Lai
ADHOC
2005
122views more  ADHOC 2005»
15 years 6 months ago
Maintaining weakly-connected dominating sets for clustering ad hoc networks
An ad hoc network is a multihop wireless communication network supporting mobile users. Network performance degradation is a major problem as the network becomes larger. Clusterin...
Yuanzhu Peter Chen, Arthur L. Liestman
IJRR
2007
60views more  IJRR 2007»
15 years 6 months ago
Randomized Algorithms for Minimum Distance Localization
We address the problem of minimum distance localization in environments that may contain self-similarities. A mobile robot is placed at an unknown location inside a ¢¤£ self-sim...
Malvika Rao, Gregory Dudek, Sue Whitesides
TCS
2008
15 years 6 months ago
Itemset frequency satisfiability: Complexity and axiomatization
Computing frequent itemsets is one of the most prominent problems in data mining. We study the following related problem, called FREQSAT, in depth: given some itemset-interval pai...
Toon Calders
ITA
2007
101views Communications» more  ITA 2007»
15 years 6 months ago
Learning tree languages from text
We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability as introduced by the author in Theoretical Computer Sc...
Henning Fernau