Sciweavers

430 search results - page 38 / 86
» A New Linearizing Restriction in the Pattern Matching Proble...
Sort
View
PODS
2006
ACM
138views Database» more  PODS 2006»
16 years 5 months ago
Efficiently ordering subgoals with access constraints
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
Guizhen Yang, Michael Kifer, Vinay K. Chaudhri
TWC
2010
15 years 6 days ago
Fast algorithms for joint power control and scheduling in wireless networks
This paper studies the problem of finding a minimum-length schedule of a power-controlled wireless network subject to traffic demands and SINR (signal-to-interferenceplus-noise rat...
Liqun Fu, Soung Chang Liew, Jianwei Huang
ICB
2007
Springer
148views Biometrics» more  ICB 2007»
15 years 11 months ago
Walker Recognition Without Gait Cycle Estimation
Abstract. Most of gait recognition algorithms involve walking cycle estimation to accomplish signature matching. However, we may be plagued by two cycle-related issues when develop...
Daoliang Tan, Shiqi Yu, Kaiqi Huang, Tieniu Tan
144
Voted
EVOW
2004
Springer
15 years 9 months ago
Evolving Regular Expression-Based Sequence Classifiers for Protein Nuclear Localisation
A number of bioinformatics tools use regular expression (RE) matching to locate protein or DNA sequence motifs that have been discovered by researchers in the laboratory. For exam...
Amine Heddad, Markus Brameier, Robert M. MacCallum
190
Voted
FOCS
2006
IEEE
15 years 11 months ago
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
Uriel Feige, Jan Vondrák