Sciweavers

5022 search results - page 940 / 1005
» Data structures and problem solving using Java
Sort
View
ICDE
1998
IEEE
270views Database» more  ICDE 1998»
14 years 9 months ago
Cyclic Association Rules
We study the problem of discovering association rules that display regular cyclic variation over time. For example, if we compute association rules over monthly sales data, we may...
Banu Özden, Sridhar Ramaswamy, Abraham Silber...
RECOMB
2006
Springer
14 years 8 months ago
A Parsimony Approach to Genome-Wide Ortholog Assignment
The assignment of orthologous genes between a pair of genomes is a fundamental and challenging problem in comparative genomics, since many computational methods for solving various...
Zheng Fu, Xin Chen, Vladimir Vacic, Peng Nan, Yang...
RECOMB
2005
Springer
14 years 8 months ago
Reconstruction of Reticulate Networks from Gene Trees
Abstract. One of the simplest evolutionary models has molecular sequences evolving from a common ancestor down a bifurcating phylogenetic tree, experiencing point-mutations along t...
Daniel H. Huson, Tobias H. Klöpper, Pete J. L...
ATAL
2009
Springer
14 years 2 months ago
Computing optimal randomized resource allocations for massive security games
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
Christopher Kiekintveld, Manish Jain, Jason Tsai, ...
IWCMC
2006
ACM
14 years 1 months ago
Effective channel assignment in multi-hop W-CDMA cellular networks
Multi-hop relaying is an important concept in tackling the inherent problems of limited capacity and coverage in cellular networks. It helps to solve the dead-spots problem and to...
Yik Hung Tam, Hossam S. Hassanein, Selim G. Akl