Sciweavers

14078 search results - page 2027 / 2816
» Design and Analysis of Computer Algorithms
Sort
View
PODS
2006
ACM
138views Database» more  PODS 2006»
16 years 7 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
SAC
2004
ACM
16 years 1 months ago
Time-frequency feature detection for time-course microarray data
Gene clustering based on microarray data provides useful functional information to the working biologists. Many current gene-clustering algorithms rely on Euclidean-based distance...
Jiawu Feng, Paolo Emilio Barbano, Bud Mishra
SIGECOM
2003
ACM
135views ECommerce» more  SIGECOM 2003»
16 years 25 days ago
Playing large games using simple strategies
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
Richard J. Lipton, Evangelos Markakis, Aranyak Meh...
ICRA
2002
IEEE
187views Robotics» more  ICRA 2002»
16 years 16 days ago
Trajectory Planning using Reachable-State Density Functions
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
Richard Mason, Joel W. Burdick
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
16 years 12 days ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
« Prev « First page 2027 / 2816 Last » Next »