Sciweavers

10271 search results - page 1890 / 2055
» Computer Science
Sort
View
ICALP
2009
Springer
16 years 6 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
PODS
2006
ACM
138views Database» more  PODS 2006»
16 years 6 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
MOBIHOC
2006
ACM
16 years 6 months ago
Modeling steady-state and transient behaviors of user mobility: : formulation, analysis, and application
Recent studies on mobility modeling have focused on characterizing user mobility from real traces of wireless LANs (WLANs) and creating mobility models based on such characterizat...
Jong-Kwon Lee, Jennifer C. Hou
SDM
2009
SIAM
138views Data Mining» more  SDM 2009»
16 years 3 months ago
ShatterPlots: Fast Tools for Mining Large Graphs.
Graphs appear in several settings, like social networks, recommendation systems, computer communication networks, gene/protein biological networks, among others. A deep, recurring...
Ana Paula Appel, Andrew Tomkins, Christos Faloutso...
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
16 years 3 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki
« Prev « First page 1890 / 2055 Last » Next »