Sciweavers

1322 search results - page 102 / 265
» Parameterized counting problems
Sort
View
DAMON
2009
Springer
14 years 3 months ago
A new look at the roles of spinning and blocking
Database engines face growing scalability challenges as core counts exponentially increase each processor generation, and the efficiency of synchronization primitives used to prot...
Ryan Johnson, Manos Athanassoulis, Radu Stoica, An...
COLT
2003
Springer
14 years 2 months ago
Learning from Uncertain Data
The application of statistical methods to natural language processing has been remarkably successful over the past two decades. But, to deal with recent problems arising in this ï¬...
Mehryar Mohri
DCOSS
2010
Springer
14 years 1 months ago
On Multihop Broadcast over Adaptively Duty-Cycled Wireless Sensor Networks
Abstract. We consider the problem of multihop broadcast over adaptively duty-cycled wireless sensor networks (WSNs) where neighborhood nodes are not simultaneously awake. We presen...
Shouwen Lai, Binoy Ravindran
DMIN
2007
158views Data Mining» more  DMIN 2007»
13 years 10 months ago
Mining Frequent Itemsets Using Re-Usable Data Structure
- Several algorithms have been introduced for mining frequent itemsets. The recent datasettransformation approach suffers either from the possible increasing in the number of struc...
Mohamed Yakout, Alaaeldin M. Hafez, Hussein Aly
COMBINATORICS
2000
72views more  COMBINATORICS 2000»
13 years 8 months ago
Tournament Sequences and Meeussen Sequences
A tournament sequence is an increasing sequence of positive integers (t1, t2, . . .) such that t1 = 1 and ti+1 2ti. A Meeussen sequence is an increasing sequence of positive inte...
Matthew Cook, Michael Kleber