Sciweavers

7988 search results - page 1054 / 1598
» A Useful Undecidable Theory
Sort
View
SDM
2009
SIAM
112views Data Mining» more  SDM 2009»
16 years 4 months ago
A Re-evaluation of the Over-Searching Phenomenon in Inductive Rule Learning.
Most commonly used inductive rule learning algorithms employ a hill-climbing search, whereas local pattern discovery algorithms employ exhaustive search. In this paper, we evaluat...
Frederik Janssen, Johannes Fürnkranz
EUROSYS
2009
ACM
16 years 4 months ago
Predicting replicated database scalability from standalone database profiling
This paper develops analytical models to predict the throughput and the response time of a replicated database using measurements of the workload on a standalone database. These m...
Sameh Elnikety, Steven G. Dropsho, Emmanuel Cecche...
ICCAD
2002
IEEE
104views Hardware» more  ICCAD 2002»
16 years 4 months ago
A new enhanced SPFD rewiring algorithm
This paper presents an in-depth study of the theory and algorithms for the SPFD-based (Set of Pairs of Functions to be Distinguished) rewiring, and explores the flexibility in the...
Jason Cong, Joey Y. Lin, Wangning Long
TLDI
2009
ACM
142views Formal Methods» more  TLDI 2009»
16 years 4 months ago
Static extraction of sound hierarchical runtime object graphs
For many object-oriented systems, it is often useful to have a runtime architecture that shows networks of communicating objects. But it is hard to statically extract runtime obje...
Marwan Abi-Antoun, Jonathan Aldrich
CSCW
2010
ACM
16 years 4 months ago
Reading between the lines: linguistic cues to deception in online dating profiles
This study investigates whether deception in online dating profiles is detectable through a linguistic approach, which assumes that liars nonconsciously produce different word pat...
Catalina L. Toma, Jeffrey T. Hancock
« Prev « First page 1054 / 1598 Last » Next »