Sciweavers

4114 search results - page 681 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
KDD
2001
ACM
181views Data Mining» more  KDD 2001»
14 years 9 months ago
Identifying non-actionable association rules
Building predictive models and finding useful rules are two important tasks of data mining. While building predictive models has been well studied, finding useful rules for action...
Bing Liu, Wynne Hsu, Yiming Ma
POPL
2008
ACM
14 years 9 months ago
Lightweight semiformal time complexity analysis for purely functional data structures
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
Nils Anders Danielsson
POPL
2003
ACM
14 years 9 months ago
Selective memoization
We present a framework for applying memoization selectively. The framework provides programmer control over equality, space usage, and identification of precise dependences so tha...
Umut A. Acar, Guy E. Blelloch, Robert Harper
STOC
2001
ACM
147views Algorithms» more  STOC 2001»
14 years 9 months ago
Conditions on input vectors for consensus solvability in asynchronous distributed systems
This article introduces and explores the condition-based approach to solve the consensus problem in asynchronous systems. The approach studies conditions that identify sets of inpu...
Achour Mostéfaoui, Michel Raynal, Sergio Ra...
SIGMOD
2009
ACM
134views Database» more  SIGMOD 2009»
14 years 9 months ago
Keyword query cleaning using hidden Markov models
In this paper, we consider the problem of keyword query cleaning for structured databases from a probabilistic approach. Keyword query cleaning consists of rewriting the user quer...
Ken Q. Pu